On domination elimination orderings and domination graphs

DOI10.1007/3-540-59071-4_39zbMath1530.05142OpenAlexW1539574100MaRDI QIDQ6184360

Peter L. Hammer, Elias Dahlhaus, Frédéric Maffray, Stephan Olariu

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59071-4_39

zbMATH Keywords

perfect elimination orderingsmaximum cardinality search procedure

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Some aspects of perfect elimination orderings in chordal graphs
• Topics on perfect graphs
• Weakly triangulated graphs
• A note on superbrittle graphs
• A fast algorithm for coloring Meyniel graphs
• On the perfect graph conjecture
• Optimizing weakly triangulated graphs
• On the semi-perfect elimination
• A characterisation of rigid circuit 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
• Scheduling Interval-Ordered Tasks
• Polynomially bounded algorithms for locatingp-centers on a tree
• Algorithmic Aspects of Vertex Elimination on Graphs

This page was built for publication: On domination elimination orderings and domination graphs