Nearly light cycles in embedded graphs and crossing-critical graphs

@article{Lomel2006NearlyLC,
  title={Nearly light cycles in embedded graphs and crossing-critical graphs},
  author={Mario Lomel{\'i} and Gelasio Salazar},
  journal={Journal of Graph Theory},
  year={2006},
  volume={53},
  pages={151-156}
}
The purpose of this discussion is to give a proof of Theorem 6 in “Nearly–light cycles in embedded graphs and crossing–critical graphs” [1]. Since this is clearly not intended as a stand–alone manuscript, but as an addendum to [1], we proceed right away to state and prove Theorem 6 in that paper. Theorem 1 (Theorem 6 in [1]). For each ε > 0 and integer χ ≤ 2 there exist `0 := `0(ε, χ), ∆0 := ∆0(ε, χ), c := c(ε, χ) with the following property. Let G = (V, E) be a simple connected graph with… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Nearly–light cycles in embedded graphs and crossing–critical

  • M. Lomeĺı, G. Salazar
  • 2005
2 Excerpts

Addendum to “ Nearly – light cycles and crossing – critical graphs ” Light paths in 4 - connected graphs in the plane and other surfaces

  • R. Škrekovski Mohar, H. – J. Voss
  • J . Graph Theory
  • 2000

Similar Papers

Loading similar papers…