scientific article; zbMATH DE number 446487
From MaRDI portal
Publication:3142409
Recommendations
Cited in
(87)- An upper bound on adaptable choosability of graphs
- The chromatic polynomial and list colorings
- Some results on (a:b)-choosability
- On list critical graphs
- The concentration of the chromatic number of random graphs
- The choice number of random bipartite graphs
- Edge-choosability in line-perfect multigraphs
- Choosability and fractional chromatic numbers
- Arrays of distinct representatives --- a very simple NP-complete problem
- \(T\)-choosability in graphs
- Cardinal invariants of closed graphs
- Path choosability of planar graphs
- Extension from precoloured sets of edges
- Uniquely restricted matchings and edge colorings
- Computing the list chromatic index of graphs
- Graph edge coloring: a survey
- Restraints permitting the largest number of colourings
- On structure of some plane graphs with application to choosability
- Choosability in random hypergraphs
- On the subspace choosability in graphs
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- On restricted colorings of (d, s)-edge colorable graphs
- Colouring \((P_r + P_s)\)-free graphs
- Incidence choosability of graphs
- The odd-distance plane graph
- Coloring subgraphs with restricted amounts of hues
- On choosability of some complete multipartite graphs and Ohba's conjecture
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
- List coloring of Cartesian products of graphs
- List edge colourings of some 1-factorable multigraphs
- Facial list colourings of plane graphs
- List colorings with distinct list sizes, the case of complete bipartite graphs
- A colour-sliding problem on graphs
- A note on total and list edge-colouring of graphs of tree-width 3
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- A survey of graph coloring -- its types, methods and applications
- Bounds on edge colorings with restrictions on the union of color classes
- Bounds on vertex colorings with restrictions on the union of color classes
- Coloring the vertices of a graph with majority restrictions on colors
- A Coloring Problem With Restrictions of Adjacent Colors
- Choosability of P 5-Free Graphs
- Jacobsthal numbers in generalised Petersen graphs
- The tournament scheduling problem with absences
- Colouring without colours: graphs and matroids
- The parameterised complexity of list problems on graphs of bounded treewidth
- The list-chromatic number of infinite graphs
- Application of polynomial method to on-line list colouring of graphs
- Graph colorings with local constraints -- a survey
- Dense uniform hypergraphs have high list chromatic number
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
- Orientations of graphs with prescribed weighted out-degrees
- On-line list colouring of random graphs
- scientific article; zbMATH DE number 1390136 (Why is no real title available?)
- Hypergraph containers
- Coloring Graphs with Constraints on Connectivity
- An introduction to the discharging method via graph coloring
- Colouring H-free graphs of bounded diameter.
- Extremal problems in hypergraph colourings
- A proof of a conjecture of Ohba
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Extremal restraints for graph colourings
- Some of my favorite coloring problems for graphs and digraphs
- Two Chromatic Conjectures: One for Vertices and One for Edges
- A broken cycle theorem for the restrained chromatic function
- List-coloring graphs without subdivisions and without immersions
- Amenable colorings
- Colouring graphs of bounded diameter in the absence of small cycles
- Colouring graphs of bounded diameter in the absence of small cycles
- List Ramsey numbers
- Coloring, list coloring, and painting squares of graphs (and other related problems)
- 5-list coloring toroidal 6-regular triangulations in linear time
- Total colorings-a survey
- The Alon-Tarsi number of a toroidal grid
- Packing list‐colorings
- On the complexity of some colorful problems parameterized by treewidth
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- The adaptable choosability number grows with the choosability number
- On two generalizations of the Alon-Tarsi polynomial method
- Chromatic-choosability of hypergraphs with high chromatic number
- Exact and parameterized algorithms for choosability
- Planar graphs without cycles of specific lengths
- Chip games and paintability
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Some colouring problems for Paley graphs
- Graph polynomials and paintability of plane graphs
- Pfaffian labelings and signs of edge colorings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142409)
