Vertex ordering characterizations of graphs of bounded asteroidal number
From MaRDI portal
Recommendations
Cites work
- 3-colouring AT-free graphs in polynomial time
- A characterisation of rigid circuit graphs
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- A simple polynomial algorithm for the longest path problem on cocomparability graphs
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- Almost diameter of a house-hole-free graph in linear time via LexBFS
- An optimal greedy heuristic to color interval graphs
- Asteroidal Triple-Free Graphs
- Diameter determination on restricted graph families
- Domination on Cocomparability Graphs
- scientific article; zbMATH DE number 2191988 (Why is no real title available?)
- Incidence matrices and interval graphs
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- LexBFS-orderings and powers of chordal graphs
- Linear Orderings of Subfamilies of AT‐Free Graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- On rigid circuit graphs
- On the power of graph searching for cocomparability graphs
- Optimal greedy algorithms for indifference graphs
- Representation of a finite graph by a set of intervals on the real line
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The LBFS structure and recognition of interval graphs
- Triangulated graphs and the elimination process
Cited in
(13)- Characterising AT-free graphs with BFS
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- A vertex ordering characterization of simple-triangle graphs
- Gray codes for AT-free orders via antimatroids
- Vertex ranking of asteroidal triple-free graphs
- Induced separation dimension
- scientific article; zbMATH DE number 7511525 (Why is no real title available?)
- Linear Orderings of Subfamilies of AT‐Free Graphs
- Graph classes and forbidden patterns on three vertices
- Asteroidal triple-free graphs
- Gallai-like characterization of strong cocomparability graphs
- Obstructions to faster diameter computation: asteroidal sets
- The induced separation dimension of a graph
This page was built for publication: Vertex ordering characterizations of graphs of bounded asteroidal number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940988)
