Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897578
DOI10.1007/11604686zbMath1123.68096MaRDI QIDQ5897578
Stavros D. Nikolopoulos, Leonidas Palios
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
recognition; perfectly orderable graphs; sun; HHD-free graphs; homogeneously orderable graphs; HHDS-free graphs
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Finding a sun in building-free graphs, An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs