Premium
On the homogeneous representation of interval graphs
Author(s) -
Olariu Stephan
Publication year - 1991
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190150108
Subject(s) - mathematics , combinatorics , interval graph , interval (graph theory) , vertex (graph theory) , homogeneous , graph , discrete mathematics , representation (politics) , class (philosophy) , property (philosophy) , indifference graph , chordal graph , 1 planar graph , computer science , philosophy , artificial intelligence , politics , political science , law , epistemology
An interval graph G is homogeneously representable if for every vertex v of G there exists an interval representation of G with v corresponding to an end interval. We show that the homogeneous representation of interval graphs is rooted in a deeper property of a class of graphs that we characterize by forbidden configurations.