A characterization of 2-tree probe interval graphs

DOI10.7151/dmgt.1754zbMath1305.05159OpenAlexW2063220900MaRDI QIDQ2509539

Breeann M. Flesch, David E. Brown, Richard J. Lundgren

Publication date: 28 July 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1754

zbMATH Keywords

interval graph2-treeprobe interval graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Separating subgraphs in k-trees: Cables and caterpillars
• A characterization of cycle-free unit probe interval graphs
• Interval graphs and interval orders
• On probe interval graphs
• Incidence matrices and interval graphs
• 2-tree probe interval graphs have a large obstruction set
• Representation of a finite graph by a set of intervals on the real line
• Characterizations of derived graphs
• Properties and characterizations of k ‐trees
• Linear-Time Recognition of Probe Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of 2-tree probe interval graphs