Pages that link to "Item:Q3652538"
From MaRDI portal
The following pages link to A general upper bound for the cyclic chromatic number of 3‐connected plane graphs (Q3652538):
Displaying 15 items.
- Parity vertex colouring of plane graphs (Q626871) (← links)
- Another step towards proving a conjecture by Plummer and Toft (Q960952) (← links)
- Cyclic coloring of plane graphs (Q1198649) (← links)
- A new bound on the cyclic chromatic number (Q1850557) (← links)
- On vertex types and cyclic colourings of 3-connected plane graphs (Q1970582) (← links)
- On the cyclic coloring conjecture (Q2214053) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Facial rainbow coloring of plane graphs (Q2312068) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Facial rainbow edge-coloring of plane graphs (Q2413633) (← links)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- Cyclic chromatic number of 3-connected plane graphs (Q2706194) (← links)
- A new upper bound on the cyclic chromatic number (Q3418734) (← links)
- Cyclic coloration of 3-polytopes (Q3801577) (← links)
- On a conjecture by Plummer and Toft (Q4237727) (← links)