𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partial characterizations of coordinated graphs: line graphs and complements of forests

✍ Scribed by Flavia Bonomo; Guillermo Durán; Francisco Soulignac; Gabriel Sueiro

Book ID
105857509
Publisher
Springer
Year
2008
Tongue
English
Weight
294 KB
Volume
69
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-transversal sets of line graphs a
Clique-transversal sets of line graphs and complements of line graphs
✍ Thomas Andreae; Martin Schughart; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(

Some characterizations of graphs by star
Some characterizations of graphs by star complements
✍ Dragoš Cvetković; Peter Rowlinson; Slobodan K. Simić 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Let µ be an eigenvalue of the graph G with multiplicity k. A star complement for µ in G is an induced subgraph H = G -X such that |X| = k and µ is not an eigenvalue of G -X. Various graphs related to (generalized) line graphs or their complements are characterized by star complements corresponding t

Partial characterizations of circle grap
Partial characterizations of circle graphs
✍ Flavia Bonomo; Guillermo Durán; Luciano N. Grippo; Martín D. Safe 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 324 KB
Partial characterizations of circular-ar
Partial characterizations of circular-arc graphs
✍ F. Bonomo; G. Durán; L.N. Grippo; M.D. Safe 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular‐arc graphs by a list of minim