Pages that link to "Item:Q2777607"
From MaRDI portal
The following pages link to On Graph Powers for Leaf-Labeled Trees (Q2777607):
Displaying 43 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Exact leaf powers (Q982668) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← 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)
- Maximal determinants of combinatorial matrices (Q1641998) (← 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)
- Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Some remarks about leaf roots (Q2497485) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS (Q2846475) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- (Q5089163) (← 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)
- On coloring problems with local constraints (Q5891606) (← links)
- Characterizing star-PCGs (Q5916258) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)