Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Brahana, H. R.
1923.
The Four-Color Problem.
The American Mathematical Monthly,
Vol. 30,
Issue. 5,
p.
234.
Grünbaum, Branko
1970.
Polytopes, graphs, and complexes.
Bulletin of the American Mathematical Society,
Vol. 76,
Issue. 6,
p.
1131.
Plummer, M. D.
1972.
Graph Theory and Applications.
Vol. 303,
Issue. ,
p.
235.
Fiorini, S.
1978.
A bibliographic survey of edge‐colorings.
Journal of Graph Theory,
Vol. 2,
Issue. 2,
p.
93.
Wilson, Robin J.
1978.
Theory and Applications of Graphs.
Vol. 642,
Issue. ,
p.
608.
Wilson, Robin J.
1978.
Theory and Applications of Graphs.
Vol. 642,
Issue. ,
p.
1.
Klee, Victor
1979.
Some Unsolved Problems in Plane Geometry.
Mathematics Magazine,
Vol. 52,
Issue. 3,
p.
131.
1986.
Matching Theory.
Vol. 121,
Issue. ,
p.
483.
1994.
Graph Coloring Problems.
p.
1.
Hazewinkel, Michiel
2000.
Encyclopaedia of Mathematics.
p.
479.
Onn, Shmuel
2004.
Nowhere-zero flow polynomials.
Journal of Combinatorial Theory, Series A,
Vol. 108,
Issue. 2,
p.
205.
Barahona, Francisco
2004.
Fractional Packing ofT-Joins.
SIAM Journal on Discrete Mathematics,
Vol. 17,
Issue. 4,
p.
661.
Crilly, Tony
2005.
Arthur Cayley FRS and the four-colour map problem.
Notes and Records of the Royal Society,
Vol. 59,
Issue. 3,
p.
285.
Cole, Richard
and
Kowalik, Łukasz
2008.
New Linear-Time Algorithms for Edge-Coloring Planar Graphs.
Algorithmica,
Vol. 50,
Issue. 3,
p.
351.
Lou, Dingjun
and
Wang, Wei
2008.
Characterization of graphs with infinite cyclic edge connectivity.
Discrete Mathematics,
Vol. 308,
Issue. 11,
p.
2094.
Bordewich, Magnus
Semple, Charles
and
Spillner, Andreas
2009.
Optimizing phylogenetic diversity across two trees.
Applied Mathematics Letters,
Vol. 22,
Issue. 5,
p.
638.
Král’, Daniel
Pangrác, Ondřej
Sereni, Jean-Sébastien
and
Škrekovski, Riste
2009.
Long cycles in fullerene graphs.
Journal of Mathematical Chemistry,
Vol. 45,
Issue. 4,
p.
1021.
Craft, David L.
and
White, Arthur T.
2009.
3-maps.
Discrete Mathematics,
Vol. 309,
Issue. 19,
p.
5857.
Lu, Yunting
and
Lu, Xin
2009.
An Efficient Algorithm for Cyclic Edge Connectivity of Planar Graphs.
p.
193.
Yu, Zhihua
Liu, Qinghai
and
Zhang, Zhao
2010.
Combinatorial Optimization and Applications.
Vol. 6508,
Issue. ,
p.
212.