Dyadic representations of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- scientific article; zbMATH DE number 867635 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- Algorithmic graph theory and perfect graphs
- An observation on block graphs
- Constant tolerance intersection graphs of subtrees of a tree
- Constant tolerance representations of graphs in trees
- Edge and vertex intersection of paths in a tree
- Graphs constructible from cycles and complete graphs
- Reconstruction of Cacti
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Tolerance intersection graphs on binary trees with constant tolerance 3
- Topics in Intersection Graph Theory
- Towards a comprehensive theory of conflict-tolerance graphs
This page was built for publication: Dyadic representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783614)