The backbone coloring problem for bipartite backbones
From MaRDI portal
Publication:497343
DOI10.1007/s00373-014-1462-9zbMath1327.05110MaRDI 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
05C15: Coloring of graphs and hypergraphs
Related Items
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
- 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
- Unnamed Item