Recognizing quasi-triangulated graphs.
From MaRDI portal
Publication:1428566
DOI10.1016/S0166-218X(03)00295-6zbMath1034.05036MaRDI QIDQ1428566
Publication date: 29 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
A note on perfect partial elimination, Arboricity, \(h\)-index, and dynamic algorithms, The clique operator on circular-arc graphs, Applying clique-decomposition for computing Gromov hyperbolicity, Bisimplicial edges in bipartite graphs, Recognizing Sparse Perfect Elimination Bipartite 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