Skip to content
  • Home
  • Book Bag: 0 items (Full)
    • English
    • 日本語
    • 中文(简体)
    • 中文(繁體)
    • اللغة العربية
  • About
Advanced
  • Edge-Removal and Non-Crossing...
  • Cite this
  • Text this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Add to Book Bag Remove from Book Bag
  • Permanent link

Edge-Removal and Non-Crossing Configurations in Geometric Graphs

Graphs and Algorithms

Bibliographic Details
Published in:Discrete Mathematics & Theoretical Computer Science
Main Authors: Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2010-01-01
Subjects:
extremal graph theory
geometric graph
perfect matching
spanning tree
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/525/pdf
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://dmtcs.episciences.org/525/pdf

Similar Items

  • On the chromatic number of some flip graphs
    by: Ruy Fabila-Monroy, et al.
    Published: (2009-01-01)
  • On the connectedness and diameter of a geometric Johnson graph
    by: Crevel Bautista-Santiago, et al.
    Published: (2013-09-01)
  • The Erdős-Sós conjecture for geometric graphs
    by: Luis Barba, et al.
    Published: (2013-02-01)
  • Binary Labelings for Plane Quadrangulations and their Relatives
    by: Stefan Felsner, et al.
    Published: (2011-01-01)
  • Cell-paths in mono- and bichromatic line arrangements in the plane
    by: Oswin Aichholzer, et al.
    Published: (2014-12-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs