Pages that link to "Item:Q844175"

The following pages link to Structure and linear time recognition of 3-leaf powers (Q844175):

Displaying 39 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)
• 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)
• 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)
• 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)
• The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
• Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
• Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
• Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
• Pairwise compatibility graphs: complete characterization for wheels (Q2424298) (← 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)
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs (Q4959662) (← links)
• Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← 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)
• Recognition of linear and star variants of leaf powers is in P (Q6043183) (← links)
• A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
• (Q6065472) (← links)
• Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs (Q6610090) (← links)
• Computing optimal leaf roots of chordal cographs in linear time (Q6616231) (← links)