A Simple Characterization of Proportionally 2-choosable Graphs
- 15 February 2020
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 36 (3) , 679-687
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Equitable List-Coloring for C 5-Free Plane Graphs Without Adjacent TrianglesGraphs and Combinatorics, 2013
- Equitable List Coloring of Graphs with Bounded DegreeJournal of Graph Theory, 2012
- On equitable and equitable list colorings of series–parallel graphsDiscrete Mathematics, 2011
- Equitable and equitable list colorings of graphsTheoretical Computer Science, 2010
- Equitable list coloring of planar graphs without 4- and 6-cyclesDiscrete Mathematics, 2009
- Equitable list colorings of planar graphs without short cyclesTheoretical Computer Science, 2008
- A list analogue of equitable coloringJournal of Graph Theory, 2003
- The infamous upper tailRandom Structures & Algorithms, 2002
- Equitable Coloring Extends Chernoff-Hoeffding BoundsLecture Notes in Computer Science, 2001
- Perfect Graphs and an Application to Optimizing Municipal ServicesSIAM Review, 1973