DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Leaf power
Leaf power
Discrete Mathematics Rooted Directed Path Graphs Are Leaf Powers
Closest 4-Leaf Power Is Fixed-Parameter Tractable ⋆
A Polynomial Kernel for 3-Leaf Power Deletion
Parameterized Leaf Power Recognition Via Embedding Into Graph Products
Polynomial Kernels for 3-Leaf Power Graph Modification Problems
Polynomial Kernels for 3-Leaf Power Graph Modification Problems
A Survey on Algorithmic Aspects of Modular Decomposition∗
Some Problems in Graph Theory and Graphs Algorithmic Theory Stéphane Bessy
On Alternative Models for Leaf Powers
Relating Threshold Tolerance Graphs to Other Graph Classes
Closest 4-Leaf Power Is Fixed-Parameter Tractable ⋆
Exact Leaf Powers
The 4-Steiner Root Problem Guillaume Ducoffe
Arxiv:0810.1823V1 [Cs.DM] 10 Oct 2008
On Strongly Chordal Graphs That Are Not Leaf Powers
Lipics-IPEC-2018-16.Pdf (0.5
Polynomial-Time Recognition of 4-Steiner Powers Guillaume Ducoffe
Towards a Characterization of Leaf Powers by Clique Arrangements
Top View
Some Problems in Graph Theory and Graphs Algorithmic Theory - - Habilitation `Adiriger Des Recherches
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Kernelization Algorithms for Graph and Constraint Modification Problems
On Graph Powers for Leaf-Labeled Trees
Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs with Hereditary Properties, and Activity-On-Edge Minimization
Error Compensation in Leaf Power Problems∗
00000-Mim-Iii.Pdf
Polynomial Kernels for Proper Interval Completion and Related Problems ∗
Polynomial-Time Recognition of 4-Steiner Powers
3-Leaf Power 꼭짓점 제거 문제의 다항식 커널
Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs with Hereditary Properties, and Activity-On-Edge Minimization
A Polynomial Kernel for 3-Leaf Power Deletion, Master’S Thesis, KAIST, South Korea, 2020