Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 50 items.
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- Dynamic list coloring of bipartite graphs (Q608280) (← links)
- Distinguishing graphs by their left and right homomorphism profiles (Q648964) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- On 3-choosability of triangle-free plane graphs (Q657261) (← links)
- List colourings of planar graphs (Q687126) (← links)
- Nowhere-zero flow polynomials (Q703684) (← links)
- On 3-colorings of plane graphs (Q705042) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Circular list colorings of some graphs (Q815980) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Restricted set addition: the exceptional case of the Erdős-Heilbronn conjecture (Q1024375) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- A solution to a colouring problem of P. Erdős (Q1197012) (← links)
- Binary invariants and orientations of graphs (Q1197033) (← links)
- Sumsets in vector spaces over finite fields (Q1271156) (← links)
- The list chromatic numbers of some planar graphs (Q1288297) (← links)
- The graph polynomial and the number of proper vertex colorings (Q1296159) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- On the relations of various conjectures on Latin squares and straightening coefficients (Q1322185) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- On even and odd latin squares (Q1344239) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- On the number of even and odd Latin squares of order \(p+1\) (Q1362611) (← links)
- The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture (Q1364322) (← links)
- A note on graph colorings and graph polynomials (Q1369660) (← links)
- \(T\)-choosability in graphs (Q1383364) (← links)
- Chords of longest cycles in cubic graphs (Q1386433) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- The oriented cycle game (Q1584260) (← links)
- Generalized list \(T\)-colorings of cycles (Q1775057) (← links)
- The 3-choosability of plane graphs of girth 4 (Q1781982) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- Density via duality. (Q1853500) (← links)
- On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419) (← links)