LexBFS-orderings and powers of chordal graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Convexity in Graphs and Hypergraphs
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Algorithmic Aspects of Vertex Elimination on Graphs
Perfect elimination orderings of chordal powers of graphs
On the semi-perfect elimination
On powers and centers of chordal graphs

Cited In (32)

Recognizing LBFS trees of bipartite graphs
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
Simple vertex ordering characterizations for graph search
On end-vertices of lexicographic breadth first searches
A general label search to investigate classical graph search algorithms
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Collective tree spanners in graphs with bounded parameters
On the power of graph searching for cocomparability graphs
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Maximum induced matching problem on hhd-free graphs
Perfect elimination orderings for symmetric matrices
Induced Embeddings into Hamming Graphs.
Graph extremities defined by search algorithms
On linear and circular structure of (claw, net)-free graphs
Practical and efficient split decomposition via graph-labelled trees
A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
Practical and efficient circle graph recognition
A tie-break model for graph search
Fast approximation of eccentricities and distances in hyperbolic graphs
Colouring clique-hypergraphs of circulant graphs
Colouring clique-hypergraphs of circulant graphs
Title not available (Why is that?)
Title not available (Why is that?)
Distance problems within Helly graphs and $k$-Helly graphs
End-Vertices of Graph Search Algorithms
Biclique-colouring verification complexity and biclique-colouring power graphs
Maximum induced matchings for chordal graphs in linear time
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
Partitioning a graph into convex sets
Vertex elimination orderings for hereditary graph classes
End-vertices of LBFS of (AT-free) bigraphs

Recommendations

This page was built for publication: LexBFS-orderings and powers of chordal graphs

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