Pages that link to "Item:Q4962769"

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

Displaying 26 items.

• Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
• A characterization of line graphs that are squares of graphs (Q400504) (← links)
• On the two largest distance eigenvalues of graph powers (Q503610) (← links)
• Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
• Boxicity of leaf powers (Q659669) (← links)
• Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
• Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
• The square of a block graph (Q965949) (← links)
• Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
• Exact leaf powers (Q982668) (← 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)
• Pairwise compatibility graphs: complete characterization for wheels (Q2424298) (← links)
• Complexity of finding graph roots with girth conditions (Q2428666) (← 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)
• 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)
• Recognition of linear and star variants of leaf powers is in P (Q6043183) (← links)
• A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
• Computing optimal leaf roots of chordal cographs in linear time (Q6616231) (← links)