scientific article
From MaRDI portal
Publication:3142409
zbMath0791.05034MaRDI QIDQ3142409
Publication date: 28 June 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (68)
Cardinal invariants of closed graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ Path choosability of planar graphs ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ Facial list colourings of plane graphs ⋮ On the subspace choosability in graphs ⋮ Jacobsthal numbers in generalised Petersen graphs ⋮ Choosability of P 5-Free Graphs ⋮ The tournament scheduling problem with absences ⋮ Choosability and fractional chromatic numbers ⋮ The odd-distance plane graph ⋮ Arrays of distinct representatives --- a very simple NP-complete problem ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Extension from precoloured sets of edges ⋮ Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter ⋮ The list-chromatic number of infinite graphs ⋮ \(T\)-choosability in graphs ⋮ Colouring \((P_r + P_s)\)-free graphs ⋮ List Ramsey numbers ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ 5-list coloring toroidal 6-regular triangulations in linear time ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ Total colorings-a survey ⋮ Extremal problems in hypergraph colourings ⋮ The Alon-Tarsi number of a toroidal grid ⋮ Packing list‐colorings ⋮ The list-chromatic number of infinite graphs defined on Euclidean spaces ⋮ Dense uniform hypergraphs have high list chromatic number ⋮ The adaptable choosability number grows with the choosability number ⋮ Computing the list chromatic index of graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ On-line list colouring of random graphs ⋮ Hypergraph containers ⋮ On choosability of some complete multipartite graphs and Ohba's conjecture ⋮ Pfaffian labelings and signs of edge colorings ⋮ On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\) ⋮ Parameterized complexity of coloring problems: treewidth versus vertex cover ⋮ Planar graphs without cycles of specific lengths ⋮ A broken cycle theorem for the restrained chromatic function ⋮ Amenable colorings ⋮ List coloring of Cartesian products of graphs ⋮ Restraints permitting the largest number of colourings ⋮ Chip games and paintability ⋮ An upper bound on adaptable choosability of graphs ⋮ The chromatic polynomial and list colorings ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Some results on \((a:b)\)-choosability ⋮ Colouring H-free graphs of bounded diameter. ⋮ Incidence choosability of graphs ⋮ The concentration of the chromatic number of random graphs ⋮ List edge colourings of some 1-factorable multigraphs ⋮ The choice number of random bipartite graphs ⋮ On list critical graphs ⋮ List colorings with distinct list sizes, the case of complete bipartite graphs ⋮ A Proof of a Conjecture of Ohba ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ Edge-choosability in line-perfect multigraphs ⋮ On structure of some plane graphs with application to choosability ⋮ Choosability in random hypergraphs ⋮ Unnamed Item ⋮ Some colouring problems for Paley graphs
This page was built for publication:
