Intersection graphs of proper subtrees of unicyclic graphs
From MaRDI portal
Recommendations
Cites work
- A linear algorithm for the group path problem on chordal graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- An algorithm for fraternal orientation of graphs
- An O(qn) algorithm to q-color a proper family of circular arcs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Intersection graphs of concatenable subtrees of graphs
- Recognizing claw-free perfect graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
Cited in
(6)- An algorithm for fraternal orientation of graphs
- Intersection graphs of concatenable subtrees of graphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- scientific article; zbMATH DE number 165071 (Why is no real title available?)
- \(1\)-perfectly orientable graphs and graph products
- Partial characterizations of 1-perfectly orientable graphs
This page was built for publication: Intersection graphs of proper subtrees of unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4309989)