4 papers
Adjacent vertex distinguishing total coloring of 3-degenerate graphs
Diptimaya Behera, Mathew C. Francis, Sreejith K. Pallathumadam
A total coloring of a simple undirected graph is an assignment of colors to its vertices and edges such that the colors given to the vertices form a proper vertex coloring, the…
Arborescences and Shortest Path Trees when Colors Matter
P. S. Ardra, Jasine Babu, Kritika Kashyap +3
Color-constrained subgraph problems are those where we are given an edge-colored (directed or undirected) graph and the task is to find a specific type of subgraph, like a spanning…
B-VPG Representation of AT-free Outerplanar Graphs
Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad
A -bend path is a non-self-intersecting polyline in the plane made of at most axis-parallel line segments. B-VPG is the class of graphs which can be represented as int…
Characterization and a 2D Visualization of B-VPG Cocomparability Graphs
Sreejith K. Pallathumadam, Deepak Rajendraprasad
B-VPG graphs are intersection graphs of vertical and horizontal line segments on a plane. Cohen, Golumbic, Trotter, and Wang [Order, 2016] pose the question of characterizing B…