Colorings and orientations of graphs
From MaRDI portal
Recommendations
- Graph colorings and acyclic orientations
- Colorings and orientations of matrices and graphs
- Orientable edge colorings of graphs
- The coloring of graphs
- Orthogonal colorings of graphs
- Sur le coloriage des graphs
- Colorings and girth of oriented planar graphs
- Coloring graphs in oriented coloring of cubic graphs
- Circular colouring and orientation of graphs
Cites work
- A note on list-colorings
- A nowhere-zero point in linear mappings
- Acyclic orientations of graphs
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- Independence numbers of graphs and generators of ideals
- On the decomposition of a graph into stars
- On the Structure oft-Designs
- Regular subgraphs of almost regular graphs
- Tournaments and Vandermond's determinant
Cited in
(only showing first 100 items - show all)- Ore-type versions of Brooks' theorem
- The chromatic polynomial and list colorings
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Restricted set addition: the exceptional case of the Erdős-Heilbronn conjecture
- Some results on (a:b)-choosability
- On 3-choosable planar graphs of girth at least 4
- Injective colorings of planar graphs with few colors
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
- The complexity of planar graph choosability
- List homomorphisms to reflexive graphs
- A solution to a colouring problem of P. Erdős
- Binary invariants and orientations of graphs
- Sumsets in vector spaces over finite fields
- Orthogonal colorings of graphs
- The list chromatic numbers of some planar graphs
- The graph polynomial and the number of proper vertex colorings
- The 4-choosability of plane graphs without 4-cycles
- Stable sets and polynomials
- On the relations of various conjectures on Latin squares and straightening coefficients
- Algorithmic complexity of list colorings
- On even and odd latin squares
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- On the number of even and odd Latin squares of order \(p+1\)
- The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture
- A note on graph colorings and graph polynomials
- \(T\)-choosability in graphs
- Chords of longest cycles in cubic graphs
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- The oriented cycle game
- Graphs are \((1, \varDelta + 1)\)-choosable
- Planar graphs of girth at least five are square ( + 2)-choosable
- The Alon-Tarsi number of planar graphs
- The List L(2, 1)-labeling of planar graphs
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- Efficient enumeration of graph orientations with sources
- Choice numbers of multi-bridge graphs
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- A step towards Yuzvinsky's conjecture
- Integration formulas for Brownian motion on classical compact Lie groups
- Square-root cancellation for the signs of Latin squares
- Oriented colourings of graphs with maximum degree three and four
- Planar graphs without chordal 6-cycles are 4-choosable
- Generalized list \(T\)-colorings of cycles
- The 3-choosability of plane graphs of girth 4
- A note on the DP-chromatic number of complete bipartite graphs
- Choosability, edge choosability and total choosability of outerplane graphs
- On structure of some plane graphs with application to choosability
- Coloring face-hypergraphs of graphs on surfaces
- Density via duality.
- On 2-coloring certain k-uniform hypergraphs
- On the Dinitz conjecture and related conjectures
- An exchange property of matroids
- A not 3-choosable planar graph without 3-cycles
- Choosability of planar graphs
- Matrix choosability
- Parity of transversals of Latin squares
- Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- Combinatorial Nullstellensatz and DP-coloring of graphs
- Injective choosability of subcubic planar graphs with girth 6
- A condition for the existence of zero coefficients in the powers of the determinant polynomial
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
- Answers to two questions on the DP color function
- Differences between the list-coloring and DP-coloring for planar graphs
- Isotopy graphs of Latin tableaux
- The Alon-Tarsi number of \(K_5\)-minor-free graphs
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
- Alon-Tarsi numbers of direct products
- The complexity of finding fair independent sets in cycles
- Special case of Rota's basis conjecture on graphic matroids
- Tensor slice rank and Cayley's first hyperdeterminant
- An inequality in mixed multiplicities
- On \((3, r)\)-choosability of some planar graphs
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
- A generalization of some results on list coloring and DP-coloring
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- Orthogonal colourings of Cayley graphs
- The Alon-Tarsi number of a planar graph minus a matching
- On the chromatic polynomial and counting DP-colorings of graphs
- From the 1-2-3 conjecture to the Riemann hypothesis
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
- On the complexity of Hilbert refutations for partition
- The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
- Improved lower bounds on the number of edges in list critical and online list critical graphs
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
- Chromatic number and orientations of graphs and signed graphs
- 2-colorability of \(r\)-uniform hypergraphs
- The Alon-Tarsi conjecture: a perspective on the main results
- Note on 3-choosability of planar graphs with maximum degree 4
- Computing the chromatic number using graph decompositions via matrix rank
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
- Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group
- An algebraic criterion for the choosability of graphs
- Geometric complexity theory: an introduction for geometers
- Wreath determinants for group-subgroup pairs.
- Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
- An online version of Rota's basis conjecture
- On DP-coloring of graphs and multigraphs
This page was built for publication: Colorings and orientations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196681)
