When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
zbMATH Open1413.05102MaRDI QIDQ2829074FDOQ2829074
Zsolt Tuza, E. Sampathkumar, Charles Dominic, Csilla Bujtás, L. Pushpalatha
Publication date: 26 October 2016
Published in: Ars Combinatoria (Search for Journal in Brave)
matchingline graph\(3\)-consecutive edge coloring\(3\)-consecutive vertex coloringstable \(k\)-separator
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
This page was built for publication: When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829074)