Backbone colorings of graphs with bounded degree
From MaRDI portal
Publication:968172
DOI10.1016/J.DAM.2009.11.015zbMATH Open1215.05071OpenAlexW2107502037MaRDI QIDQ968172FDOQ968172
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
Recommendations
- On backbone coloring of graphs
- Backbone colourings of graphs
- Backbone coloring for graphs with large girths
- The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
- Backbone colorings and generalized Mycielski graphs
- The backbone coloring problem for bipartite backbones
- Backbone colorings for graphs: Tree and path backbones
- Backbone coloring for triangle-free planar graphs
- Backbone coloring of graphs with galaxy backbones
- Backbone coloring of graphs with galaxy backbones
Cites Work
- Concentration of measure and isoperimetric inequalities in product spaces
- Graph colouring and the probabilistic method
- Title not available (Why is that?)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- 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
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
- The computational complexity of \(\lambda\)-backbone colorings of graphs with \(n\)-complete backbones
Cited In (16)
- Backbone coloring of graphs with galaxy backbones
- Backbone coloring of graphs with galaxy backbones
- List backbone colouring of graphs
- The computational complexity of the backbone coloring problem for planar graphs with connected backbones
- Optimal backbone coloring of split graphs with matching backbones
- Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
- Title not available (Why is that?)
- On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time
- Backbone coloring for triangle-free planar graphs
- Backbone colourings of graphs
- Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
- Backbone colorings for graphs: Tree and path backbones
- Steinberg-like theorems for backbone colouring
- Backbone coloring for graphs with large girths
- On backbone coloring of graphs
- The backbone coloring problem for bipartite backbones
This page was built for publication: Backbone colorings of graphs with bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968172)
