Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 50 items.
- Coloring, sparseness and girth (Q312271) (← links)
- Jacobsthal numbers in generalised Petersen graphs (Q322296) (← links)
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- The Combinatorial Nullstellensätze revisited (Q463059) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Period preserving properties of an invariant from the permanent of signed incidence matrices (Q509907) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- List coloring of planar graphs with forbidden cycles (Q510959) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- Fundamental invariants of orbit closures (Q517074) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← 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)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← 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)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Delay colouring in quartic graphs (Q785576) (← links)
- Circular list colorings of some graphs (Q815980) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← 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)