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
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- A note on list-colorings
- A nowhere-zero point in linear mappings
- Acyclic orientations of graphs
- Independence numbers of graphs and generators of ideals
- On the Structure oft-Designs
- On the decomposition of a graph into stars
- Regular subgraphs of almost regular graphs
- Tournaments and Vandermond's determinant
Cited in
(only showing first 100 items - show all)- Tensor slice rank and Cayley's first hyperdeterminant
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- On the chromatic polynomial and counting DP-colorings of graphs
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
- Amenable colorings
- The Dinitz problem solved for rectangles
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Combinatorial Nullstellensatz and DP-coloring of graphs
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- \((4,2)\)-choosability of planar graphs with forbidden structures
- The Alon-Tarsi number of two kinds of planar graphs
- Differences between the list-coloring and DP-coloring for planar graphs
- Square-root cancellation for the signs of Latin squares
- List colourings of planar graphs. (Reprint)
- The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture
- The complexity of finding fair independent sets in cycles
- Computing the chromatic number using graph decompositions via matrix rank
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
- Answers to two questions on the DP color function
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- Choice numbers of multi-bridge graphs
- Total choosability of multicircuits I
- Total choosability of multicircuits II
- Alon-Tarsi numbers of direct products
- Parity of transversals of Latin squares
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
- An online version of Rota's basis conjecture
- A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
- On colorings and orientations of signed graphs
- Efficient enumeration of graph orientations with sources
- Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
- An exchange property of matroids
- A step towards Yuzvinsky's conjecture
- Additive bases in abelian groups
- There are asymptotically the same number of Latin squares of each parity
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
- An algebraic formulation of hypergraph colorings
- The Alon-Tarsi number of \(K_5\)-minor-free graphs
- Beyond degree choosability
- A generalization of some results on list coloring and DP-coloring
- A condition for the existence of zero coefficients in the powers of the determinant polynomial
- DP-colorings of graphs with high chromatic number
- Fair representation by independent sets
- The odd case of Rota's bases conjecture
- Degeneracy and colorings of squares of planar graphs without 4-cycles
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- A note on the DP-chromatic number of complete bipartite graphs
- Injective choosability of subcubic planar graphs with girth 6
- Isotopy graphs of Latin tableaux
- Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field
- On 3-choosability of planar graphs without certain cycles
- Discriminants, Symmetrized Graph Monomials, and Sums Of Squares
- Oriented and injective oriented colourings of grid graphs
- On structure of some plane graphs with application to choosability
- Colorability in Orthogonal Graph Drawing
- An inequality in mixed multiplicities
- Choosability of toroidal graphs without short cycles
- Density via duality.
- The 3-choosability of plane graphs of girth 4
- A relation between choosability and uniquely list colorability
- Coloring problems on bipartite graphs of small diameter
- Chords of longest cycles in cubic graphs
- Graph polynomials and paintability of plane graphs
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- The graph polynomial and the number of proper vertex colorings
- On the complexity of Hilbert refutations for partition
- The List \(L(2, 1)\)-labeling of planar graphs
- Chromatic number and orientations of graphs and signed graphs
- Coloring face-hypergraphs of graphs on surfaces
- Oriented colourings of graphs with maximum degree three and four
- On edge orienting methods for graph coloring
- Binary invariants and orientations of graphs
- Delay colouring in quartic graphs
- A note on 3-choosability of plane graphs under distance restrictions
- On DP-coloring of graphs and multigraphs
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
- Orthogonal colourings of Cayley graphs
- Jacobsthal Numbers in Generalized Petersen Graphs
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- Circular list colorings of some graphs
- Group coloring is \(\Pi_2^{\text{P}}\)-complete
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
- Completing partial proper colorings using Hall's condition
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
- Planar graphs without intersecting 5-cycles are 4-choosable
- The Alon-Tarsi number of a planar graph minus a matching
- The Alon-Tarsi number of planar graphs
- Single‐conflict colouring
- Circular choosability via combinatorial Nullstellensatz
- On 3-choosability of triangle-free plane graphs
- Generalized list \(T\)-colorings of cycles
- A note on graph colorings and graph polynomials
- Covering almost all the layers of the hypercube with multiplicities
- Note on 3-choosability of planar graphs with maximum degree 4
- Nowhere-zero flow polynomials
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- \(T\)-choosability in graphs
- Brooks' Theorem and Beyond
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)
