Pages that link to "Item:Q5458553"
From MaRDI portal
The following pages link to Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553):
Displaying 18 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← 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)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Some classes of graphs that are not PCGs (Q2272401) (← links)
- On pairwise compatibility graphs having Dilworth number two (Q2637346) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
- Computing optimal leaf roots of chordal cographs in linear time (Q6616231) (← links)
