Pages that link to "Item:Q1396660"
From MaRDI portal
The following pages link to Choosability of powers of circuits (Q1396660):
Displaying 22 items.
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- List-colouring the square of a \(K_4\)-minor-free graph (Q941324) (← links)
- On the list dynamic coloring of graphs (Q967354) (← links)
- On list critical graphs (Q1044925) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Colouring powers of cycles from random lists (Q1883608) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- Alon-Tarsi numbers of direct products (Q2077275) (← links)
- List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- On the edit distance of powers of cycles (Q2317648) (← links)
- Locating chromatic number of powers of paths and cycles (Q2335071) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- Inflation of strongly connected networks (Q3081477) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)
- A Brooks-like result for graph powers (Q6181987) (← links)
