LexBFS-orderings and powers of graphs

DOI10.1007/3-540-62559-3_15zbMath1539.05129MaRDI QIDQ6550543

Falk Nicolai, Feodor F. Dragan, Andreas Brandstädt

Publication date: 5 June 2024

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely separable graphs
• On powers and centers of chordal graphs
• Distance-hereditary graphs
• Weak bipolarizable graphs
• On the semi-perfect elimination
• Powers of distance-hereditary graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Convexity in Graphs and Hypergraphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A characterization of ptolemaic graphs
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Algorithmic Aspects of Vertex Elimination on Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Dominating cliques in distance-hereditary graphs
• A Characterization of Certain Ptolemaic Graphs
• Approximating the bandwidth for asteroidal triple-free graphs
• Dually chordal graphs

Related Items (2)

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities

This page was built for publication: LexBFS-orderings and powers of graphs