Home » Subject » Graph Theory

Coloring

Also see: Graph Theory » Topological G.T. » Coloring
TitleAuthor(s)Imp.¹Rec.²Subtopicsort iconPosted by
Three-chromatic (0,2)-graphsPayan✭✭0Gordon Royle
Total Colouring ConjectureBehzad✭✭✭0Iradmusa
4-regular 4-chromatic graphs of high girthGrunbaum✭✭0mdevos
Coloring the union of degenerate graphsTarsi✭✭0fhavet
Petersen coloring conjectureJaeger✭✭✭0Edge coloringmdevos
Packing T-joinsDeVos✭✭0Edge coloringmdevos
Acyclic edge-colouringFiamcik✭✭0Edge coloringmdevos
A generalization of Vizing's Theorem?Rosenfeld✭✭0Edge coloringmdevos
List colorings of edge-critical graphsMohar✭✭0Edge coloringRobert Samal
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Edge coloringmacajova
Edge list coloring conjecture✭✭✭0Edge coloringtchow
Seymour's r-graph conjectureSeymour✭✭✭0Edge coloringmdevos
Goldberg's conjectureGoldberg✭✭✭0Edge coloringmdevos
Strong edge colouring conjectureErdos; Nesetril✭✭0Edge coloringfhavet
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
Graceful Tree Conjecture✭✭✭0Labelingkintali
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0LabelingDOT
5-flow conjectureTutte✭✭✭✭0Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Nowhere-zero flowsmdevos
(2 + epsilon)-flow conjectureGoddyn; Seymour✭✭✭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
Strong colorabilityAharoni; Alon; Haxell✭✭✭0Vertex coloringberger
Reed's omega, delta, and chi conjectureReed✭✭✭0Vertex coloringmdevos
Alon-Saks-Seymour ConjectureAlon; Saks; Seymour✭✭✭0Vertex coloringmdevos
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Vertex coloringmdevos
Bounding the chromatic number of graphs with no odd holeGyarfas✭✭✭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
Coloring squares of hypercubesWan✭✭1Vertex 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

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

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

Syndicate content