Concepedia
Discrete Applied Mathematics · 2017 · 29 citations · 30 references
30
Every planar map is four colorable. Part I: Discharging
K. I. Appel, Wolfgang Haken · Illinois Journal of Mathematics · 1977 · 879 citations
Architecture, Architectural Representation, Descriptive Geometry +2
Edge-Disjoint Spanning Trees of Finite Graphs
C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1961 · 805 citations
Natural Sciences, Mathematics, Combinatorics +7
Arboricity and Subgraph Listing Algorithms
Norishige Chiba, Takao Nishizeki · SIAM Journal on Computing · 1985 · 665 citations
Computing, Computer Science, Algorithms +14
Decomposition of Finite Graphs Into Forests
C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1964 · 462 citations
Natural Sciences, Biology, Graph Visualization +5
Algorithms for graphs embeddable with few crossings per edge
Research Publications (Maastricht University) · 2007 · 114 citations
Computing, Computer Science, Mathematics +13