Lexbfs-orderings and powers of hhd-free graphs∗

DOI10.1080/00207169908804791MaRDI QIDQ4254590zbMATH OpenOpenAlexFDO

Authors 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

HHD-free graphLexBFS orderinglexicographic breadth-first searchperfect elimination orderingpowersemisimplicial ordering

Mathematics Subject Classification ID

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

Recommendations

• LexBFS-orderings and powers of chordal graphs
• Powers of hhd-free graphs^∗
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem

Cites work

• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Algorithmic Aspects of Vertex Elimination on Graphs
• Duchet-type theorems for powers of HHD-free graphs
• Finding a central vertex in an HHD-free graph
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• Incidence matrices and interval graphs
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• On brittle graphs
• On rigid circuit graphs
• On the semi-perfect elimination
• Powers of distance-hereditary graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Weak bipolarizable graphs

Cited in

(6)

• LexBFS-orderings and powers of chordal graphs
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
• Powers of hhd-free graphs^∗
• Induced embeddings into Hamming graphs
• Walk Domination and HHD-Free Graphs
• LexBFS-orderings and powers of graphs

This page was built for publication: Lexbfs-orderings and powers of hhd-free graphs^∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254590)