Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 30 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)