Intersection graphs of proper subtrees of unicyclic graphs
From MaRDI portal
Publication:4309989
DOI10.1002/jgt.3190180609zbMath0809.05035MaRDI QIDQ4309989
Publication date: 27 November 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180609
cycle; characterizations; intersection graph; polynomial algorithm; connected graph; rooted tree; fraternal orientation; acanthus; concatenable edge subtrees
05C05: Trees
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- A linear algorithm for the group path problem on chordal graphs
- An O(qn) algorithm to q-color a proper family of circular arcs
- Recognizing claw-free perfect graphs
- An algorithm for fraternal orientation of graphs
- Intersection graphs of concatenable subtrees of graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism