𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Contracting Graphs to Paths and Trees

✍ Scribed by Heggernes, Pinar; Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe

Book ID
111982070
Publisher
Springer
Year
2012
Tongue
English
Weight
838 KB
Volume
68
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trees and unicyclic graphs with hamilton
Trees and unicyclic graphs with hamiltonian path graphs
✍ Xingxing Yu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract We prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.

Backbone colorings for graphs: Tree and
Backbone colorings for graphs: Tree and path backbones
✍ Hajo Broersma; Fedor V. Fomin; Petr A. Golovach; Gerhard J. Woeginger 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph __G__ = (__V__,__E__) and a spanning subgraph __H__ of __G__ (the backbone of __G__), a backbone coloring for __G__ and __H__ is a proper vertex coloring __V__ → {1,2,…} of __G__ in which