On the semi-perfect elimination

DOI10.1016/0196-8858(88)90019-XzbMath0684.05020MaRDI QIDQ1825204

Yanyan Li

Publication date: 1988

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cliqueperfect elimination

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (31)

Lexbfs-orderings and powers of hhd-free graphs^∗ ⋮ Powers of hhd-free graphs^∗ ⋮ An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs ⋮ LexBFS-orderings and powers of chordal graphs ⋮ Welsh-Powell opposition graphs ⋮ An nc algorithm to recognize hhd-free graphs ⋮ A note on \(r\)-dominating cliques ⋮ Homogeneously orderable graphs ⋮ Separability generalizes Dirac's theorem ⋮ A general label search to investigate classical graph search algorithms ⋮ The parallel complexity of elimination ordering procedures ⋮ On linear and circular structure of (claw, net)-free graphs ⋮ On domination elimination orderings and domination graphs ⋮ Finding a central vertex in an HHD-free graph ⋮ Classes of perfect graphs ⋮ Induced matchings in asteroidal triple-free graphs ⋮ LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem ⋮ Some aspects of the semi-perfect elimination ⋮ All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected ⋮ On distance-preserving elimination orderings in graphs: complexity and algorithms ⋮ The induced path function, monotonicity and betweenness ⋮ Finding houses and holes in graphs ⋮ Diameter determination on restricted graph families ⋮ Walk Domination and HHD-Free Graphs ⋮ Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs ⋮ Undirected Graphs of Entanglement 2 ⋮ Recognition of some perfectly orderable graph classes ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Maximum induced matching problem on hhd-free graphs ⋮ Induced Embeddings into Hamming Graphs. ⋮ On 3-Steiner simplicial orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Topics on perfect graphs
• Tolerance graphs
• A note on superbrittle graphs
• Incidence matrices and interval graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• On brittle graphs
• Four classes of perfectly orderable graphs
• Algorithmic Aspects of Vertex Elimination on Graphs

This page was built for publication: On the semi-perfect elimination