Graphs drawn with few crossings per edge
COMBINATORICA1997Vol. 17(3), pp. 427–439
Citations Over TimeTop 10% of 1997 papers
Related Papers
- → On degree sums of a triangle-free graph(2014)3 cited
- → Some new upper bounds of ex(n;{C3,C4})(2017)1 cited
- A Lower Bound on Minus Domination Number of a Graph(2010)
- On the five-color K_4 problem of the n -order complete graph(2004)