Home » Subject » Graph Theory

Coloring

Also see: Graph Theory » Topological G.T. » Coloring
TitleAuthor(s)Imp.¹Rec.²Subtopicsort iconPosted by
Strong colorabilityAharoni; Alon; Haxell✭✭✭0Vertex coloringberger
Reed's omega, delta, and chi conjectureReed✭✭✭0Vertex coloringmdevos
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Vertex coloringmdevos
Oriented chromatic number of planar graphs✭✭0Vertex coloringRobert Samal
Coloring and immersionAbu-Khzam; Langston✭✭✭1Vertex coloringmdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Vertex coloringmdevos
Partial List ColoringAlbertson; Grossman; Haas✭✭✭0Vertex coloringIradmusa
Partial List ColoringIradmusa✭✭✭0Vertex coloringIradmusa
Hedetniemi's ConjectureHedetniemi✭✭✭0Vertex coloringmdevos
Counting 3-colorings of the hex latticeThomassen✭✭0Vertex coloringmdevos
Circular colouring the orthogonality graphDeVos; Ghebleh; Goddyn; Mohar; Naserasr✭✭0Vertex coloringmdevos
Double-critical graph conjectureErdos; Lovasz✭✭0Vertex coloringDFR
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Vertex coloringAndrew King
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Vertex coloringmdevos
Are vertex minor closed classes chi-bounded?Geelen✭✭0Vertex coloringmdevos
Mixing Circular ColouringsBrewster; Noel✭1Vertex coloringJon Noel
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Vertex coloringJon Noel
Melnikov's valency-variety problemMelnikov✭0Vertex coloringasp
Earth-Moon ProblemRingel✭✭1Vertex coloringfhavet
Acyclic list colouring of planar graphs.Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena✭✭✭0Vertex coloringfhavet
List chromatic number and maximum degree of bipartite graphsAlon✭✭0Vertex coloringfhavet
Colouring the square of a planar graphWegner✭✭0Vertex coloringfhavet
Weighted colouring of hexagonal graphs.McDiarmid; Reed✭✭0Vertex coloringfhavet
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Vertex coloringJon Noel
Choosability of Graph PowersNoel✭✭1Vertex coloringJon Noel
Erdős–Faber–Lovász conjectureErdos; Faber; Lovasz✭✭✭0Vertex coloringJon Noel
2-colouring a graph without a monochromatic maximum cliqueHoang; McDiarmid✭✭0Vertex coloringJon Noel
List Colourings of Complete Multipartite Graphs with 2 Big PartsAllagan✭✭1Vertex coloringJon Noel
List Hadwiger ConjectureKawarabayashi; Mohar✭✭0Vertex coloringDavid Wood
Cycles in Graphs of Large Chromatic NumberBrewster; McGuinness; Moore; Noel✭✭0Vertex coloringJon Noel
5-flow conjectureTutte✭✭✭✭0Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Nowhere-zero flowsmdevos
Bouchet's 6-flow conjectureBouchet✭✭✭0Nowhere-zero flowsmdevos
The three 4-flows conjectureDeVos✭✭0Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Nowhere-zero flowsmdevos
Real roots of the flow polynomialWelsh✭✭0Nowhere-zero flowsmdevos
Unit vector flowsJain✭✭0Nowhere-zero flowsmdevos
Antichains in the cycle continuous orderDeVos✭✭0Nowhere-zero flowsmdevos
Circular flow number of regular class 1 graphsSteffen✭✭0Nowhere-zero flowsEckhard Steffen
Graceful Tree Conjecture✭✭✭0Labelingkintali
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0LabelingDOT
Cores of Cayley graphsSamal✭✭0HomomorphismsRobert Samal
Pentagon problemNesetril✭✭✭0HomomorphismsRobert Samal
Mapping planar graphs to odd cyclesJaeger✭✭✭0Homomorphismsmdevos
Weak pentagon problemSamal✭✭0HomomorphismsRobert Samal
Algorithm for graph homomorphismsFomin; Heggernes; Kratsch✭✭0Homomorphismsjfoniok
Circular choosability of planar graphsMohar✭0Homomorphismsrosskang
Petersen coloring conjectureJaeger✭✭✭0Edge coloringmdevos

Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.

Note: Resolved problems from this section may be found in Solved problems.

Syndicate content