Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs

doi 10.1145/997817.997831
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Finding Paths in Sparse Random Graphs Requires Many Queries

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

A Crossing Lemma for Jordan Curves

Advances in Mathematics
Mathematics
2018English

Splitting Lemma for 2-Connected Graphs

ISRN Discrete Mathematics
2012English

Are Crossings Important for Drawing Large Graphs?

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Braess’s Paradox in Large Sparse Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Parallel Symmetry-Breaking in Sparse Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1988English

Stars and Bonds in Crossing-Critical Graphs

Journal of Graph Theory
GeometryTopology
2010English

Finding Large Cycles in Hamiltonian Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy