The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
Alan Tucker; Rick Giles; Leslie E. Trotter;
The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
A simple adjacency criterion is presented which, when satisfied, implies that a minimal imperfect graph is an odd hole or an odd antihole. For certain classes of graphs, including K 1,3 -free graphs, it is straightforward to validate this criterion and thus establish the Strong Perfect Graph Theorem for such graphs.
- State University of New York United States
- Acadia University Canada
- Cornell University United States
- State University of New York at Potsdam United States
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).15 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
citations
Citations provided by BIP!
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 15
Average
Top 10%
Average
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?