Lexbfs-orderings and powers of hhd-free graphs∗

DOI10.1080/00207169908804791zbMath0934.05110OpenAlexW2042246718MaRDI QIDQ4254590

Feodor F. Dragan, Falk Nicolai

Publication date: 10 April 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804791

zbMATH Keywords

powerHHD-free graphperfect elimination orderinglexicographic breadth-first searchLexBFS orderingsemisimplicial ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items

Induced Embeddings into Hamming Graphs.

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Weak bipolarizable graphs
• Duchet-type theorems for powers of HHD-free graphs
• Finding a central vertex in an HHD-free graph
• On the semi-perfect elimination
• Powers of distance-hereditary graphs
• Incidence matrices and interval graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• On brittle graphs
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Algorithmic Aspects of Vertex Elimination on Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS