Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988): Difference between revisions

@@ Property / cites work @@
+LexBFS-orderings and powers of chordal graphs
@@ Property / cites work: LexBFS-orderings and powers of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463350
@@ Property / cites work: Q5463350 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
+Normal rank
@@ Property / cites work @@
+LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+Diameter determination on restricted graph families
+Normal rank
@@ Property / cites work @@
+On the Power of Graph Searching for Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+Linear Orderings of Subfamilies of AT‐Free Graphs
+Normal rank
@@ Property / cites work @@
+A Unified View of Graph Searching
@@ Property / cites work: A Unified View of Graph Searching / rank @@
+Normal rank
@@ Property / cites work @@
+Asteroidal Triple-Free Graphs
@@ Property / cites work: Asteroidal Triple-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
+Normal rank
@@ Property / cites work @@
+The LBFS Structure and Recognition of Interval Graphs
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Almost diameter of a house-hole-free graph in linear time via LexBFS
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Domination on Cocomparability Graphs
@@ Property / cites work: Domination on Cocomparability Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+Optimal greedy algorithms for indifference graphs
@@ Property / cites work: Optimal greedy algorithms for indifference graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+An optimal greedy heuristic to color interval graphs
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+-colouring AT-free graphs in polynomial time
@@ Property / cites work: 3-colouring AT-free graphs in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank