Colouring a graph frugally
From MaRDI portal
Publication:1280272
DOI10.1007/BF01195001zbMath0910.05023OpenAlexW2024071264MaRDI QIDQ1280272
Hugh Hind, Michael S. O. Molloy, Bruce A. Reed
Publication date: 14 March 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01195001
Related Items (33)
Linear coloring of planar graphs without 4-cycles ⋮ A General Framework for Hypergraph Coloring ⋮ Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph ⋮ On linear coloring of planar graphs with small girth ⋮ Nondegenerate colourings in the Brooks theorem ⋮ Improved bounds on coloring of graphs ⋮ Improved bounds on linear coloring of plane graphs ⋮ Upper bounds on the linear chromatic number of a graph ⋮ \(k\)-forested coloring of planar graphs with large girth ⋮ Frugal, acyclic and star colourings of graphs ⋮ Intersection dimension and graph invariants ⋮ A result on linear coloring of planar graphs ⋮ Linear colorings of subcubic graphs ⋮ Linear and 2-frugal choosability of graphs of small maximum average degree ⋮ Linear choosability of graphs ⋮ Conflict-Free Colourings of Graphs and Hypergraphs ⋮ Star Chromatic Index ⋮ New upper bounds on linear coloring of planar graphs ⋮ Asymptotically optimal frugal colouring ⋮ Dynamic proper colorings of a graph ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Linear choosability of sparse graphs ⋮ The complexity of frugal colouring ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Separation dimension and degree ⋮ Bounds on vertex colorings with restrictions on the union of color classes ⋮ Better bounds for poset dimension and boxicity ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ \(k\)-forested choosability of planar graphs and sparse graphs ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ Linear coloring of planar graphs with large girth ⋮ Linear coloring of graphs
Cites Work
This page was built for publication: Colouring a graph frugally
