Skip to content
  • Home
  • Book Bag: 0 items (Full)
    • English
    • 日本語
    • 中文(简体)
    • 中文(繁體)
    • اللغة العربية
  • About
Advanced
  • The Price of Connectivity for...
  • 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

The Price of Connectivity for Vertex Cover

Graph Theory

Bibliographic Details
Published in:Discrete Mathematics & Theoretical Computer Science
Main Authors: Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2014-04-01
Subjects:
discrete mathematics
graph theory
theoretical computer science
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/1262/pdf
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

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

Similar Items

  • On the complexity of the balanced vertex ordering problem
    by: Jan Kára, et al.
    Published: (2007-01-01)
  • Graphs with many vertex-disjoint cycles
    by: Dieter Rautenbach, et al.
    Published: (2012-09-01)
  • On the complexity of vertex-coloring edge-weightings
    by: Andrzej Dudek, et al.
    Published: (2011-11-01)
  • Strong parity vertex coloring of plane graphs
    by: Tomas Kaiser, et al.
    Published: (2014-03-01)
  • Strong parity vertex coloring of plane graphs
    by: Tomas Kaiser, et al.
    Published: (2014-01-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