The following pages link to On the semi-perfect elimination (Q1825204):
Displaying 19 items.
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected (Q659731) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- On 3-Steiner simplicial orderings (Q1045119) (← links)
- Welsh-Powell opposition graphs (Q1115450) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- LexBFS-orderings and powers of chordal graphs (Q1363684) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- Walk Domination and HHD-Free Graphs (Q6489357) (← links)
