Pages that link to "Item:Q1348659"
From MaRDI portal
The following pages link to Group chromatic number of graphs without \(K_5\)-minors (Q1348659):
Displaying 14 items.
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- Group chromatic number of Halin graphs (Q497348) (← links)
- A note on group choosability of graphs with girth at least 4 (Q659688) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- A small non-\(\mathbb Z_4\)-colorable planar graph (Q879348) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions (Q2053689) (← links)
- Graph polynomials and group coloring of graphs (Q2122688) (← links)
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs (Q2334069) (← links)
- Group connectivity and matchings (Q2354611) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- On group chromatic number of graphs (Q2494108) (← links)
- Disproof of the group coloring version of the Hadwiger conjecture (Q2920883) (← links)
- HAJÓS-LIKE THEOREM FOR GROUP COLORING (Q3063613) (← links)
