Towards a characterization of leaf powers by clique arrangements
From MaRDI portal
Publication:343767
DOI10.1007/s00373-016-1707-xzbMath1349.05138arXiv1402.1425OpenAlexW1646789727MaRDI QIDQ343767
Christian Rosenke, Ragnar Nevries
Publication date: 29 November 2016
Published in: Lecture Notes in Computer Science, Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.1425
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Perfect graphs (05C17)
Related Items (9)
Unnamed Item ⋮ Pairwise Compatibility Graphs: A Survey ⋮ New results on pairwise compatibility graphs ⋮ Recognition of linear and star variants of leaf powers is in P ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ Characterizing and computing the structure of clique intersections in strongly chordal graphs ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ Mim-width. III. Graph powers and generalized distance domination problems ⋮ A survey on pairwise compatibility graphs
Cites Work
- Structure and linear time recognition of 3-leaf powers
- Rooted directed path graphs are leaf powers
- The clique-separator graph for chordal graphs
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Characterizations of strongly chordal graphs
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- Counting clique trees and computing perfect elimination schemes in parallel
- Neighborhood subtree tolerance graphs
- Exploring pairwise compatibility graphs
- Some remarks about leaf roots
- Error compensation in leaf power problems
- On Graph Powers for Leaf-Labeled Trees
- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
- The 3-Steiner Root Problem
- On (k,ℓ)-Leaf Powers
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- On the tree representation of chordal graphs
- A characterization of ptolemaic graphs
- Power of Natural Semijoins
- Topics in Intersection Graph Theory
- Structure and linear-time recognition of 4-leaf powers
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Simplicial Powers of Graphs
- On k- Versus (k + 1)-Leaf Powers
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
This page was built for publication: Towards a characterization of leaf powers by clique arrangements
