Asteroidal triples of moplexes

DOI10.1016/S0166-218X(00)00278-XMaRDI QIDQ5939228zbMATH OpenOpenAlexWikidataFDO

Authors Anne Berry, Jean-Paul Bordat

Publication date 7 February 2002

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

Full work available at URL https://doi.org/10.1016/s0166-218x(00)00278-x

zbMATH Keywords

asteroidal tripleAT-free graphsindependent setinterval graphmoplextriangulation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Asteroidal Triple-Free Graphs
• Asteroidal Triple of Edges in Bichordal Graphs: A Complete list
• Triangulating graphs without asteroidal triples
• scientific article; zbMATH DE number 2191988
• Independent sets in asteroidal triple-free graphs

Cites work

• Approximating the bandwidth for asteroidal triple-free graphs
• Asteroidal Triple-Free Graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1107735 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• On rigid circuit graphs
• On the structure of graphs with bounded asteroidal number
• On treewidth and minimum fill-in of asteroidal triple-free graphs
• Representation of a finite graph by a set of intervals on the real line
• Separability generalizes Dirac's theorem
• Tolerance graphs
• Triangulating graphs without asteroidal triples

Cited in

(3)

• Representing a concept lattice by a graph
• Graphs with at most two moplexes
• Obstructions to faster diameter computation: asteroidal sets

This page was built for publication: Asteroidal triples of moplexes

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