Split-critical and uniquely split-colorable graphs

MaRDI QIDQ5396744zbMATH OpenFDO

Authors Tınaz Ekim, Bernard Ries, Dominique De Werra

Publication date 3 February 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1479/0.html

zbMATH Keywords

split-coloringsplit-criticalsplit-decreasinguniquely split-colorable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On split-coloring problems
• On colorings of split graphs
• Grundy coloring of special vertex split graphs
• On the approximation of Min Split-coloring and Min Cocoloring
• Edge Coloring of Split Graphs

Cited in

(4)

• On colorings of split graphs
• On splittable colorings of graphs and hypergraphs
• Grundy coloring of special vertex split graphs
• On split-coloring problems

This page was built for publication: Split-critical and uniquely split-colorable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396744)