Asteroidal sets and dominating paths

DOI10.1007/978-3-031-49611-0_15MaRDI QIDQ6606182zbMATH OpenFDO

Authors Oleksiy Al-saadi, Jamie Radcliffe

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49611-0_15

zbMATH Keywords

asteroidal triplechordaldiametral pathdistancehereditary dominating pair

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• Algorithmic graph theory and perfect graphs
• Algorithms on Graphs with Small Dominating Targets
• Asteroidal triple-free graphs
• BetweenO(nm) andO(n^alpha)
• Diametral path graphs
• Dominating Pair Graphs
• Domination and total domination on asteroidal triple-free graphs
• Feedback vertex set on AT-free graphs
• Hereditary dominating pair graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• On the complexity of rainbow vertex colouring diametral path graphs
• Representation of a finite graph by a set of intervals on the real line
• The diameter of AT‐free graphs

Cited in

(1)

• Corrigendum to: ``The diameter of AT-free graphs

This page was built for publication: Asteroidal sets and dominating paths

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