Computer Science
3 years ago

Doubly Convex Bipartite Graphs Proven to Have Interval Total Colorings

1 view
Mathematical Problems of Computer Science
On Interval Total Colorings of Doubly Convex Bipartite Graphs
Petros A. Petrosyan, Ani S. Shashikyan

Paper Summary

Doubly convex bipartite graphs can be colored in a special way where each vertex's neighbors have numbers in a consecutive order. The researchers showed that all these graphs can be colored like this. They also found some limits on how far apart the colors can be in this type of coloring.

Related papers

Theme background image
Mathematics
8 years ago

New Study Reveals Bipartite Graphs Can Contain Multiple Disjoint Cycles.

Graph Theory
Optical CDMA
Graph Labeling
Decision Sciences
4 years ago

New vertex coloring method revolutionizes graph theory with fewer colors needed!

Staff Scheduling
Graph Theory
Routing Problem
Theme background image
Computer Science
5 years ago

New research reveals key to creating highly interconnected and colorful graphs.

Graph Theory
Graph Labeling
Graph Theory