Home » Subject » Graph Theory

Coloring

Also see: Graph Theory » Topological G.T. » Coloring
TitleAuthor(s)sort iconImp.¹Rec.²SubtopicPosted by
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Vertex coloringJon Noel
Real roots of the flow polynomialWelsh✭✭0Nowhere-zero flowsmdevos
Colouring the square of a planar graphWegner✭✭0Vertex coloringfhavet
5-flow conjectureTutte✭✭✭✭0Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Nowhere-zero flowsmdevos
Counting 3-colorings of the hex latticeThomassen✭✭0Vertex coloringmdevos
Coloring the union of degenerate graphsTarsi✭✭0fhavet
Circular flow number of regular class 1 graphsSteffen✭✭0Nowhere-zero flowsEckhard Steffen
Seymour's r-graph conjectureSeymour✭✭✭0Edge coloringmdevos
Cores of Cayley graphsSamal✭✭0HomomorphismsRobert Samal
Weak pentagon problemSamal✭✭0HomomorphismsRobert Samal
A generalization of Vizing's Theorem?Rosenfeld✭✭0Edge coloringmdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Vertex coloringmdevos
Earth-Moon ProblemRingel✭✭1Vertex coloringfhavet
Reed's omega, delta, and chi conjectureReed✭✭✭0Vertex coloringmdevos
Three-chromatic (0,2)-graphsPayan✭✭0Gordon Royle
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Vertex coloringJon Noel
Choosability of Graph PowersNoel✭✭1Vertex coloringJon Noel
Pentagon problemNesetril✭✭✭0HomomorphismsRobert Samal
List colorings of edge-critical graphsMohar✭✭0Edge coloringRobert Samal
Circular choosability of planar graphsMohar✭0Homomorphismsrosskang
Melnikov's valency-variety problemMelnikov✭0Vertex coloringasp
Weighted colouring of hexagonal graphs.McDiarmid; Reed✭✭0Vertex coloringfhavet
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Vertex coloringAndrew King
List Hadwiger ConjectureKawarabayashi; Mohar✭✭0Vertex coloringDavid Wood
Unit vector flowsJain✭✭0Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Nowhere-zero flowsmdevos
Petersen coloring conjectureJaeger✭✭✭0Edge coloringmdevos
Mapping planar graphs to odd cyclesJaeger✭✭✭0Homomorphismsmdevos
Partial List ColoringIradmusa✭✭✭0Vertex coloringIradmusa
2-colouring a graph without a monochromatic maximum cliqueHoang; McDiarmid✭✭0Vertex coloringJon Noel
Hedetniemi's ConjectureHedetniemi✭✭✭0Vertex coloringmdevos
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Vertex coloringmdevos
4-regular 4-chromatic graphs of high girthGrunbaum✭✭0mdevos
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Edge coloringmacajova
Goldberg's conjectureGoldberg✭✭✭0Edge coloringmdevos
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Vertex coloringmdevos
Are vertex minor closed classes chi-bounded?Geelen✭✭0Vertex coloringmdevos
Algorithm for graph homomorphismsFomin; Heggernes; Kratsch✭✭0Homomorphismsjfoniok
Acyclic edge-colouringFiamcik✭✭0Edge coloringmdevos
Strong edge colouring conjectureErdos; Nesetril✭✭0Edge coloringfhavet
Double-critical graph conjectureErdos; Lovasz✭✭0Vertex coloringDFR
Erdős–Faber–Lovász conjectureErdos; Faber; Lovasz✭✭✭0Vertex coloringJon Noel
Circular colouring the orthogonality graphDeVos; Ghebleh; Goddyn; Mohar; Naserasr✭✭0Vertex coloringmdevos
The three 4-flows conjectureDeVos✭✭0Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Nowhere-zero flowsmdevos
Packing T-joinsDeVos✭✭0Edge coloringmdevos
Antichains in the cycle continuous orderDeVos✭✭0Nowhere-zero flowsmdevos
Mixing Circular ColouringsBrewster; Noel✭1Vertex coloringJon Noel

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

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

Syndicate content