Perfect elimination orderings of chordal powers of graphs

DOI10.1016/0012-365X(95)00081-7zbMath0948.05050MaRDI QIDQ1815326

Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi

Publication date: 7 November 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chordal graphsperfect elimination ordering

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (11)

The \(b\)-chromatic number of powers of hypercube ⋮ LexBFS-orderings and powers of chordal graphs ⋮ Perfect elimination orderings for symmetric matrices ⋮ LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem ⋮ On \(b\)-coloring of powers of hypercubes ⋮ Chromatic sets of power graphs and their application to resource placement in multicomputer networks ⋮ Exact values for theb-chromatic number of a power completek-ary tree ⋮ Unnamed Item ⋮ The b-chromatic number of power graphs of complete caterpillars ⋮ Geodetic number of powers of cycles ⋮ On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some aspects of perfect elimination orderings in chordal graphs
• On powers and centers of chordal graphs
• A characterisation of rigid circuit graphs
• Powers of distance-hereditary graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Convexity in Graphs and Hypergraphs

This page was built for publication: Perfect elimination orderings of chordal powers of graphs