On a unique tree representation for \(P_ 4\)-extendible graphs
From MaRDI portal
Publication:1182318
DOI10.1016/0166-218X(91)90085-BzbMath0754.05051MaRDI QIDQ1182318
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C75: Structural characterization of families of graphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Cites Work
- A tree representation for \(P_ 4\)-sparse graphs
- On a property of the class of n-colorable graphs
- Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A Linear Recognition Algorithm for Cographs
- On the tree representation of chordal graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- Unnamed Item
- Unnamed Item
- Unnamed Item