Pages that link to "Item:Q866539"
From MaRDI portal
The following pages link to Strictly chordal graphs are leaf powers (Q866539):
Displayed 24 items.
- New results on Ptolemaic graphs (Q499349) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- The complete inclusion structure of leaf power classes (Q1040592) (← links)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- Ptolemaic and planar cover-incomparability graphs (Q2665829) (← links)
- ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS (Q2846475) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
- On k- Versus (k + 1)-Leaf Powers (Q5505655) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i> (Q6075860) (← links)
- Strictly chordal graphs: structural properties and integer Laplacian eigenvalues (Q6185992) (← links)