Graph-Theoretic Concepts in Computer Science

DOI10.1007/b93953zbMath1255.05076MaRDI QIDQ5902516

Gerhard J. Woeginger, Fedor V. Fomin, Hajo J. Broersma, Petr A. Golovach

Publication date: 12 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Circular backbone colorings: on matching and tree backbones of planar 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 ⋮ List backbone colouring of graphs ⋮ Backbone coloring of planar graphs without special circles ⋮ (Circular) backbone colouring: forest backbones in planar graphs ⋮ \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings ⋮ The computational complexity of the backbone coloring problem for planar graphs with connected backbones

This page was built for publication: Graph-Theoretic Concepts in Computer Science