The following pages link to (Q3912613):
Displaying 48 items.
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- The Clar and Fries structures of a fullerene. I (Q323049) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- Clar chains and a counterexample (Q460880) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- Duality and perfection for edges in cliques (Q595674) (← links)
- Parity vertex colouring of plane graphs (Q626871) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups (Q920101) (← links)
- Potential energy function based on the narcissus constant, its square and its cube (Q926936) (← links)
- Signed permutations and the four color theorem (Q1034539) (← links)
- Heawood inequalities (Q1092918) (← links)
- Map coloring and the vector cross product (Q1099183) (← links)
- The chromatic connectivity of graphs (Q1110536) (← links)
- Labeling angles of planar graphs (Q1115878) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- Cubic map configurations (Q1153097) (← links)
- Développements recents de la théorie des graphes (Q1226996) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Lie algebras and the four color theorem (Q1375054) (← links)
- 4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501) (← links)
- Enclosure of the numerical range of a class of non-selfadjoint rational operator functions (Q1676930) (← links)
- An algebraic approach to the planar coloring problem (Q1803205) (← links)
- Signed diagonal flips and the four color theorem (Q1817590) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Perfect Clar structures and 3-homogeneous simplicial complexes (Q1862050) (← links)
- A categorical setting for the 4-colour theorem (Q1901000) (← links)
- Triangulations (Q1923507) (← links)
- Unique-maximum edge-colouring of plane graphs with respect to faces (Q2341735) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes (Q2410263) (← links)
- Fullerenes with complete Clar structure (Q2446888) (← links)
- Planar Eulerian triangulations are equivalent to spherical Latin bitrades (Q2469205) (← links)
- Efficient approximation algorithms for the achromatic number (Q2503345) (← links)
- Clar and fries numbers for benzenoids (Q2517614) (← links)
- Facial list colourings of plane graphs (Q2629297) (← links)
- Counting 5-connected planar triangulations (Q2746482) (← links)
- Coloring planar graphs via colored paths in the associahedra (Q2854965) (← links)
- A simple dissertation around the Berge problem and the Hadwiger conjecture (Q3560582) (← links)
- A unified approach to layout wirability (Q3754571) (← links)
- Topological notions for Kauffman and Vogel's polynomial (Q4414976) (← links)
- Zig-zag facial total-coloring of plane graphs (Q4561211) (← links)
- Problems on pairs of trees and the four colour problem of planar graphs (Q4630251) (← links)
- Odd facial colorings of acyclic plane graphs (Q5061684) (← links)
- Reviews <i>Graph Theory in America: The First Hundred Years</i> . By Robin Wilson, John J. Watkins, and David J. Parks, Princeton University Press, 2023. 320 pp., ISBN 978-0691194028, $35.00. (Q6058323) (← links)
- Four coloring for a subset of maximal planar graphs with minimum degree five (Q6567665) (← links)
- Facial graceful coloring of plane graphs (Q6642849) (← links)
