β-Perfect Graphs
Copyright policy ) G.S. Gasparian; Bruce Reed; S.E. Markossian;
β-Perfect Graphs
AbstractThe class ofβ-perfect graphs is introduced. We draw a number of parallels between these graphs and perfect graphs. We also introduce some special classes ofβ-perfect graphs. Finally, we show that the greedy algorithm can be used to colour a graphGwith no even chordless cycles using at most 2(χ(G)−1) colours.
- University of Waterloo Canada
- University of Waterloo (Canada) Canada
- Yerevan State University Armenia
Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science
Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science
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).29 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.Top 10% 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! 29
Top 10%
Top 10%
Average
hybrid
Fields of Science