Pages that link to "Item:Q5311103"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311103):
Displaying 7 items.
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions (Q2053689) (← links)
- A note on edge-group choosability of planar graphs without 5-cycles (Q2221861) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)