25 pretty graph colouring problems
From MaRDI portal
Publication:5931450
DOI10.1016/S0012-365X(00)00206-5zbMath0971.05046OpenAlexW2011622799MaRDI QIDQ5931450
Publication date: 30 October 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00206-5
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Related Items
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion, Coloring permutation graphs in parallel, Minimal vertex Ramsey graphs and minimal forbidden subgraphs, Minimal reducible bounds for induced-hereditary properties, Borodin's conjecture on diagonal coloring is false, On 3-colorable planar graphs without cycles of four lengths, List coloring in the absence of two subgraphs, A triangle-free circle graph with chromatic number 5, \(F\)-WORM colorings: results for 2-connected graphs, Local coloring of self complementary graphs, Colourings of graphs by labellings, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Asymptotically good edge correspondence colourings, Coloring squares of planar graphs with girth six, A survey of graph coloring - its types, methods and applications, On 3-colorable planar graphs without prescribed cycles, Inequalities for the Grundy chromatic number of graphs, Edge-colouring of regular graphs of large degree, A survey on the distance-colouring of graphs, The Erdős-Faber-Lovász conjecture for dense hypergraphs, The \(L(2,1)\)-labeling on graphs and the frequency assignment problem, Fractional coloring and the odd Hadwiger's conjecture, A wide-ranging computational comparison of high-performance graph colouring algorithms, A bound on the chromatic number of the square of a planar graph, The transformation graph \(G^{xyz}\) when \(xyz=-++\), On the fractional chromatic index of a graph and its complement, Cyclic, diagonal and facial colorings, (\(\Delta-k\))-critical graphs, Planar graphs without cycles of length from 4 to 7 are 3-colorable, Path colorings in bipartite graphs, A note on list improper coloring planar graphs, Finite-dimensional \(T\)-colorings of graphs, Generic automorphisms and graph coloring, A relation between choosability and uniquely list colorability, On lower bounds for the chromatic number in terms of vertex degree, Linear choosability of sparse graphs, Acyclic colouring of 1-planar graphs, A Brooks-type result for sparse critical graphs, Unique Factorization Theorem and Formal Concept Analysis, On the odd-minor variant of Hadwiger's conjecture, Labeling trees with a condition at distance two, Signed diagonal flips and the four color theorem, On flows in bidirected graphs, Graph imperfection. I, Planar graphs of maximum degree seven are Class I, Families of regular graphs in regular maps, Coloring the faces of convex polyhedra so that like colors are far apart, Asymptotically the list colouring constants are 1, Graph imperfection. II, Unique list-colourability and the fixing chromatic number of graphs, Inequalities involving the irredundance number of a graph, On a tree-partition problem, 4-edge-coloring graphs of maximum degree 3 in linear time, An approximation algorithm for maximum packing of 3-edge paths, A note on the size of edge-chromatic 4-critical graphs, On the performance of the first-fit coloring algorithm on permutation graphs, \(\Delta \)-list vertex coloring in linear time, A note on 2-facial coloring of plane graphs, A note on the not 3-choosability of some families of planar graphs, The game chromatic number and the game colouring number of cactuses, A bound on the strong chromatic index of a graph, Edge coloring regular graphs of high degree, Coloring immersion-free graphs, Star chromatic bounds, On the optimal transversals of the odd cycles, A new proof of Grünbaum's 3 color theorem, Results on the Grundy chromatic number of graphs, On extensions of a conjecture of Gallai, On the chromatic number and independence number of hypergraph products, \(\lambda\)-coloring matrogenic graphs, List edge and list total colorings of planar graphs without 4-cycles, List edge and list total colourings of multigraphs, A bibliography on chromatic polynomials, \([r,s,t\)-colorings of graphs], \([r,s,t\)-chromatic numbers and hereditary properties of graphs], On invariants of hereditary graph properties, Mixed dominating matrices, The pagenumber of toroidal graphs is at most seven, Generalised game colouring of graphs, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Distance constraints in graph color extensions, Bounds for chromatic number in terms of even-girth and booksize, Application of polynomial method to on-line list colouring of graphs, On the complexity of some colorful problems parameterized by treewidth, Topological minors in graphs of large girth, On the size of edge chromatic critical graphs, A sufficient condition for planar graphs to be 3-colorable, An investigation into two bin packing problems with ordering and orientation implications, A worthy family of semisymmetric graphs, Subcolorings and the subchromatic number of a graph, Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles, Coloring planar Toeplitz graphs and the stable set polytope., 3-colorability and forbidden subgraphs. I: Characterizing pairs, Randomly colouring graphs (a combinatorial view), On sparse graphs with given colorings and homomorphisms., Entire colouring of plane graphs, Ore's conjecture on color-critical graphs is almost true, Some structural properties of planar graphs and their applications to 3-choosability, A greedy partition lemma for directed domination, Thickness and colorability of geometric graphs, \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs, Upper bounds for the achromatic and coloring numbers of a graph, Online interval coloring with packing constraints, Nowhere-zero 3-flows in triangularly connected graphs, On the max coloring problem, Asymptotically optimal frugal colouring, Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs, Facial colorings using Hall's theorem, Planar graphs without cycles of specific lengths, Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \), Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs, On a hypercube coloring problem, Edge-choosability of planar graphs without non-induced 5-cycles, A note on the acyclic 3-choosability of some planar graphs, Acyclic 3-choosability of sparse graphs with girth at least 7, Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable, Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles, Splits of circuits, Acyclic 4-choosability of planar graphs without adjacent short cycles, Reconfiguration of list edge-colorings in a graph, On multiples of simple graphs and Vizing's theorem, Two-dimensional online bin packing with rotation, Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable, List-edge and list-total colorings of graphs embedded on hyperbolic surfaces, The strong chromatic index of a class of graphs, Structural properties and edge choosability of planar graphs without 4-cycles, On 3-colorable planar graphs without short cycles, A distance-labelling problem for hypercubes, The edge version of Hadwiger's conjecture, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, Linear time self-stabilizing colorings, On the roots of chromatic polynomials, Achieving maximum chromatic index in multigraphs, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, Borel chromatic numbers, Short solution of Kotzig's problem for bipartite graphs, Self-stabilizing coloration in anonymous planar networks, The Erdős-Lovász tihany conjecture for quasi-line graphs, An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs, On the 3-colorability of planar graphs without 4-, 7- and 9-cycles, Injective colorings of planar graphs with few colors, 3-maps, Every circle graph of girth at least 5 is 3-colourable, On list edge-colorings of subcubic graphs, On universal graphs for planar oriented graphs of a given girth, On the small graphs with chromatic number 5 without 4-cliques, On uniquely \(3\)-colorable graphs. II, Coloring of integer distance graphs, On uniquely partitionable planar graphs, Complexity of choosing subsets from color sets, Developments in bivarite spline interpolation, Edge-choosability of multicircuits, Colouring the discretization graphs arising in the multigrid method
