Premium
A GENERALIZATION OF DIRACS THEOREM* ON TRIANGULATED GRAPHS
Author(s) -
Golumbic Martin Charles
Publication year - 1979
Publication title -
annals of the new york academy of sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.712
H-Index - 248
eISSN - 1749-6632
pISSN - 0077-8923
DOI - 10.1111/j.1749-6632.1979.tb32795.x
Subject(s) - chordal graph , bipartite graph , combinatorics , mathematics , robertson–seymour theorem , generalization , strong perfect graph theorem , discrete mathematics , graph , 1 planar graph , mathematical analysis
S ummary Golumbic and Goss [5] introduced the class of chordal bipartite graphs, which was shown to be the bipartite analog of triangulated graphs. This paper completes the connection by proving a stronger theorem for chordal bipartite graphs and by deriving some previously known results on triangulated graphs.