On the structure of graphs with bounded asteroidal number

MaRDI QIDQ2741345zbMATH OpenFDO

Authors Ton Kloks, Dieter Kratsch, Haiko Müller

Publication date 23 September 2001

Full work available at URL http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• On the structure of graphs with bounded asteroidal number
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• Domination and total domination on asteroidal triple-free graphs
• Algorithms on Graphs with Small Dominating Targets
• scientific article; zbMATH DE number 1107735

Cited in

(6)

• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• On the domination search number
• On asteroidal sets in chordal graphs
• scientific article; zbMATH DE number 5717213 (Why is no real title available?)
• Asteroidal triples of moplexes
• On the structure of graphs with bounded asteroidal number

This page was built for publication: On the structure of graphs with bounded asteroidal number

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