Asteroidal triple-free graphs
From MaRDI portal
Publication:6143978
DOI10.1007/3-540-57899-4_54zbMath1530.05061MaRDI QIDQ6143978
Lorna K. Stewart, Stephan Olariu, Derek Gordon Corneil
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Related Items (1)
Cites Work
- Tolerance graphs
- Trapezoid graphs and their coloring
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Complement reducible graphs
- Domination on Cocomparability Graphs
- Representation of a finite graph by a set of intervals on the real line
- Asteroidal Triple-Free Graphs
- Transitiv orientierbare Graphen
- Permutation Graphs and Transitive Graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Asteroidal triple-free graphs