Optimal backbone coloring of split graphs with matching backbones

DOI10.7151/DMGT.1786MaRDI QIDQ2259577zbMATH OpenOpenAlexFDO

Authors Krzysztof Turowski

Publication date 4 March 2015

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1786

zbMATH Keywords

backbone coloringmatchingsplit graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
• The backbone coloring problem for bipartite backbones
• Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
• On backbone coloring of graphs
• Backbone colourings of graphs

Cites work

• Backbone colorings for graphs: Tree and path backbones
• Backbone colorings of graphs with bounded degree
• Combinatorial Geometry and Graph Theory
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)

Cited in

(4)

• The backbone coloring problem for bipartite backbones
• Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
• Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time

This page was built for publication: Optimal backbone coloring of split graphs with matching backbones

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