Backbone colorings for graphs: Tree and path backbones
From MaRDI portal
Publication:3445508
DOI10.1002/jgt.20228zbMath1118.05031OpenAlexW4239435115WikidataQ60488754 ScholiaQ60488754MaRDI QIDQ3445508
Fedor V. Fomin, Gerhard J. Woeginger, Petr A. Golovach, Hajo J. Broersma
Publication date: 11 June 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20228
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)
Related Items (20)
Circular backbone colorings: on matching and tree backbones of planar graphs ⋮ Backbone colourings of graphs ⋮ Backbone coloring for triangle-free planar graphs ⋮ Backbone coloring for graphs with large girths ⋮ Backbone colouring: tree backbones with small diameter in planar graphs ⋮ On backbone coloring of graphs ⋮ List backbone colouring of graphs ⋮ Steinberg-like theorems for backbone colouring ⋮ Backbone coloring of planar graphs without special circles ⋮ (Circular) backbone colouring: forest backbones in planar graphs ⋮ The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones ⋮ The backbone coloring problem for bipartite backbones ⋮ Steinberg-like theorems for backbone colouring ⋮ Backbone colorings of graphs with bounded degree ⋮ Optimal backbone coloring of split graphs with matching backbones ⋮ Backbone coloring of graphs with galaxy backbones ⋮ Backbone coloring of graphs with galaxy backbones ⋮ On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring ⋮ Labeling bipartite permutation graphs with a condition at distance two ⋮ Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
Cites Work
This page was built for publication: Backbone colorings for graphs: Tree and path backbones
