Tolerance intersection graphs on binary trees with constant tolerance 3

DOI10.1016/S0012-365X(99)00231-9zbMath0947.05055OpenAlexW2095263228WikidataQ127674034 ScholiaQ127674034MaRDI QIDQ1974525

Robert E. Jamison, Henry Martyn Mulder

Publication date: 12 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00231-9

zbMATH Keywords

tolerancechordal graphintersection graphsbinary treessubtree representation

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

NeST graphs, Generalized disk graphs, Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2, What Is between Chordal and Weakly Chordal Graphs?, Intersection graphs of orthodox paths in trees, Constant threshold intersection graphs of orthodox paths in trees, Inductive graph invariants and approximation algorithms, Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs, Approximation algorithms for intersection graphs, The \(k\)-edge intersection graphs of paths in a tree, Representing edge intersection graphs of paths on degree 4 trees, Towards a comprehensive theory of conflict-tolerance graphs, Constant tolerance intersection graphs of subtrees of a tree, Dyadic representations of graphs, Equivalences and the complete hierarchy of intersection graphs of paths in a tree, Recognizing vertex intersection graphs of paths on bounded degree trees, Intersection models of weakly chordal graphs, Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review