Backbone colorings of graphs with bounded degree

DOI10.1016/j.dam.2009.11.015zbMath1215.05071OpenAlexW2107502037MaRDI QIDQ968172

Martin Tancer, Riste Škrekovski, Jozef Miškuf

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.015

zbMATH Keywords

channel assignmentcoloringcoloring numberbackbone coloringdistant labelings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Backbone coloring for graphs with large girths ⋮ On backbone coloring of graphs ⋮ List backbone colouring of graphs ⋮ The backbone coloring problem for bipartite backbones ⋮ Optimal backbone coloring of split graphs with matching backbones ⋮ Backbone coloring of graphs with galaxy backbones ⋮ Backbone coloring of graphs with galaxy backbones ⋮ Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free

Cites Work

• Unnamed Item
• Unnamed Item
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
• Concentration of measure and isoperimetric inequalities in product spaces
• Backbone colorings for graphs: Tree and path backbones
• Backbone Colorings and Generalized Mycielski Graphs
• Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
• Graph colouring and the probabilistic method

This page was built for publication: Backbone colorings of graphs with bounded degree