Recognizing quasi-triangulated graphs.

DOI10.1016/S0166-218X(03)00295-6zbMath1034.05036MaRDI QIDQ1428566

Jeremy P. Spinrad

Publication date: 29 March 2004

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

zbMATH Keywords

Cop-win graphsGood graphsPerfect elimination bipartite graphsQuasi-triangulated graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Applying clique-decomposition for computing Gromov hyperbolicity ⋮ A note on perfect partial elimination ⋮ Arboricity, \(h\)-index, and dynamic algorithms ⋮ Bisimplicial edges in bipartite graphs ⋮ Recognizing Sparse Perfect Elimination Bipartite Graphs ⋮ The clique operator on circular-arc graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Matrix multiplication via arithmetic progressions
• On the complexity of recognizing perfectly orderable graphs
• A linear-time algorithm for a special case of disjoint set union
• A note on perfect orders
• Fast rectangular matrix multiplication and applications
• Recognition of perfect elimination bipartite graphs
• Vertex-to-vertex pursuit in a graph
• Some classes of perfectly orderable graphs
• Graph Classes: A Survey