Dyadic representations of graphs

DOI10.1016/j.disc.2018.07.019zbMath1395.05115OpenAlexW2885577513MaRDI QIDQ1783614

Henry Martyn Mulder, Robert E. Jamison

Publication date: 21 September 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.07.019

zbMATH Keywords

cycledyadic\(m\)-sum\(\theta_3\)-closedtolerance representation

Mathematics Subject Classification ID

Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Edge and vertex intersection of paths in a tree
• Towards a comprehensive theory of conflict-tolerance graphs
• Constant tolerance intersection graphs of subtrees of a tree
• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• Tolerance intersection graphs on binary trees with constant tolerance 3
• Graphs constructible from cycles and complete graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Representations of chordal graphs as subtrees of a tree
• Topics in Intersection Graph Theory
• Reconstruction of Cacti

This page was built for publication: Dyadic representations of graphs