scientific article; zbMATH DE number 1299964
From MaRDI portal
Publication:4248539
zbMath0926.05019MaRDI QIDQ4248539
Publication date: 10 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
The list chromatic number of graphs with small clique number ⋮ Independent transversals in locally sparse graphs ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ Counting colorings of triangle-free graphs ⋮ Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ Colorings, transversals, and local sparsity ⋮ Asymptotically good edge correspondence colourings ⋮ List Colouring Constants of Triangle Free Graphs ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ On triangle-free list assignments ⋮ Packing list‐colorings ⋮ Unnamed Item ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ Near-optimal list colorings ⋮ The strong chromatic index ofC4-free graphs ⋮ The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ Asymptotically the list colouring constants are 1 ⋮ Cooperative colorings and independent systems of representatives ⋮ Distributed coloring algorithms for triangle-free graphs
Cites Work
This page was built for publication:
