Pages that link to "Item:Q1753049"
From MaRDI portal
The following pages link to Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049):
Displaying 5 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- On the facial Thue choice index of plane graphs (Q418875) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- Facial nonrepetitive vertex coloring of plane graphs (Q2852615) (← links)
- Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)