EPT graphs on bounded degree trees
From MaRDI portal
Recommendations
Cited in
(7)- A superclass of edge-path-tree graphs with few cliques
- Triangulated edge intersection graphs of paths in a tree
- Helly EPT graphs on bounded degree trees: characterization and recognition
- Representing edge intersection graphs of paths on degree 4 trees
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
- On local edge intersection graphs of paths on bounded degree trees
- Clique coloring EPT graphs on bounded degree trees
This page was built for publication: EPT graphs on bounded degree trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982359)