Title of article
Equistable graphs, general partition graphs, triangle graphs, and graph products Original Research Article
Author/Authors
?tefko Miklavi?، نويسنده , , Martin Milani?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
12
From page
1148
To page
1159
Abstract
In this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable, and a conjecture due to Jim Orlin states that every equistable graph is a general partition graph. The conjecture holds within the class of chordal graphs; if true in general, it would provide a combinatorial characterization of equistable graphs.
Keywords
Deleted lexicographic graph product , Lexicographic graph product , Triangle condition , Equistable graph , Triangle graph , Cartesian graph product , General partition graph , Tensor graph product , Strong graph product
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887660
Link To Document