✦ LIBER ✦

A forbidden subgraph characterization of some graph classes using betweenness axioms

✍ Scribed by Changat, Manoj; Lakshmikuttyamma, Anandavally K.; Mathews, Joseph; Peterin, Iztok; Narasimha-Shenoi, Prasanth G.; Seethakuttyamma, Geetha; Špacapan, Simon

Book ID: 119947153
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 409 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden ordered subgraph vs. forbidden

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes

✍ Ginn, Mark 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

We show that the minimum set of unordered graphs that must be forbidden to get the same graph class characterized by forbidding a single ordered graph is infinite.

A Characterization of Acyclic Switching

A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs

✍ Hage, Jurriaan; Harju, Tero 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 251 KB

A characterization of some graph classes

A characterization of some graph classes using excluded minors

✍ Janka Chlebíková 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 153 KB

Characterising the linear clique-width o

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs

✍ Pinar Heggernes; Daniel Meister; Charis Papadopoulos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 305 KB

A Characterization of Some Graph Classes

A Characterization of Some Graph Classes with No Long Holes

✍ E. Eschen; R. Sritharan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We give a characterization of a hierarchy of graph classes with no long holes in which each class excludes some long antiholes. At one end of the hierarchy is the class of graphs with no long holes. At the other end is the class of weakly triangulated graphs. The characterization has the flavor of t