The following pages link to Cyclic coloration of 3-polytopes (Q3801577):
Displaying 39 items.
- Third case of the cyclic coloring conjecture (Q322178) (← links)
- Describing 3-faces in normal plane maps with minimum degree 4 (Q394234) (← links)
- Describing faces in plane triangulations (Q394346) (← links)
- The removable edges and the contractible subgraphs of 5-connected graphs (Q489362) (← links)
- Parity vertex colouring of plane graphs (Q626871) (← links)
- Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
- On the weight of minor faces in triangle-free 3-polytopes (Q726639) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- How to contract an essentially 6-connected graph to a 5-connected graph (Q864138) (← links)
- The vertex-face weight of edges in 3-polytopes (Q901903) (← links)
- Another step towards proving a conjecture by Plummer and Toft (Q960952) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
- Cyclic coloring of plane graphs (Q1198649) (← links)
- On cyclic colorings and their generalizations (Q1301650) (← links)
- Cycles of length 0 modulo 4 in graphs (Q1309447) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- On the \(d\)-distance face chromatic number of plane graphs (Q1356701) (← links)
- Splitting and contractible edges in 4-connected graphs (Q1400957) (← links)
- Cyclic, diagonal and facial colorings (Q1767632) (← links)
- Low minor faces in 3-polytopes (Q1800413) (← links)
- Coloring the faces of convex polyhedra so that like colors are far apart (Q1850618) (← links)
- Non-contractible edges in a 3-connected graph (Q1900184) (← links)
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations (Q1999749) (← 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)
- Reduction for 3-connected graphs of minimum degree at least four (Q2373428) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Facial rainbow edge-coloring of plane graphs (Q2413633) (← links)
- Low edges in 3-polytopes (Q2515562) (← links)
- Heights of minor faces in 3-polytopes (Q2661738) (← links)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- Third Case of the Cyclic Coloring Conjecture (Q2797092) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- A general upper bound for the cyclic chromatic number of 3‐connected plane graphs (Q3652538) (← links)
- Minimal locally cyclic triangulations of the projective plane (Q4277985) (← links)
- The 3‐connected graphs with a maximum matching containing precisely one contractible edge (Q4277986) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- Heights of minor faces in triangle-free 3-polytopes (Q5963434) (← links)