The backbone coloring problem for bipartite backbones

DOI10.1007/s00373-014-1462-9zbMath1327.05110OpenAlexW2079652258MaRDI QIDQ497343

Krzysztof Turowski, Robert Janczewski

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1462-9

zbMATH Keywords

bipartite graphschromatic numberbackbone chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones ⋮ The computational complexity of the backbone coloring problem for planar graphs with connected backbones

Cites Work

• Unnamed Item
• On the complexity of bandwidth allocation in radio networks
• Backbone colorings of graphs with bounded degree
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• Optimal backbone coloring of split graphs with matching backbones
• Backbone colorings for graphs: Tree and path backbones
• Radio Labeling with Preassigned Frequencies
• Combinatorial Geometry and Graph Theory

This page was built for publication: The backbone coloring problem for bipartite backbones