A Characterization of 2-Tree Proper Interval 3-Graphs | Zendy

David E. Brown | Zendy; Breeann Flesch | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Characterization of 2-Tree Proper Interval 3-Graphs

Author(s) -

David E. Brown,

Breeann Flesch

Publication year - 2014

Publication title -

journal of discrete mathematics

Language(s) - English

Resource type - Journals

eISSN - 2090-9837

pISSN - 2090-9845

DOI - 10.1155/2014/143809

Subject(s) - combinatorics , interval graph , mathematics , intersection (aeronautics) , intersection graph , interval (graph theory) , discrete mathematics , graph , indifference graph , tree (set theory) , split graph , colored , block graph , class (philosophy) , chordal graph , 1 planar graph , line graph , computer science , artificial intelligence , geography , cartography , materials science , composite material

An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-trees which are interval 3-graphs via a list of three graphs and three infinite families of forbidden induced subgraphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research