Pages that link to "Item:Q1363684"

The following pages link to LexBFS-orderings and powers of chordal graphs (Q1363684):

Displaying 17 items.

• Practical and efficient circle graph recognition (Q472484) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
• End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
• A general label search to investigate classical graph search algorithms (Q617648) (← links)
• Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
• Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
• A tie-break model for graph search (Q896657) (← links)
• On end-vertices of lexicographic breadth first searches (Q968161) (← links)
• Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
• On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
• Graph extremities defined by search algorithms (Q1662546) (← links)
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
• An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← links)
• Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
• Induced Embeddings into Hamming Graphs. (Q5111242) (← links)