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

Strong parity vertex coloring of plane graphs

Show other versions (1)

Graph Theory

Bibliographic Details
Published in:Discrete Mathematics & Theoretical Computer Science
Main Authors: Tomas Kaiser, Ondrej Rucky, Matej Stehlik, Riste Škrekovski
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2014-03-01
Subjects:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/1268/pdf
  • Holdings
  • Description
  • Other Versions (1)
  • Similar Items
  • Staff View

Internet

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

Similar Items

  • Strong parity vertex coloring of plane graphs
    by: Tomas Kaiser, et al.
    Published: (2014-01-01)
  • A bound on the number of perfect matchings in Klee-graphs
    by: Marek Cygan, et al.
    Published: (2013-01-01)
  • Long cycles in hypercubes with distant faulty vertices
    by: Petr Gregor, et al.
    Published: (2009-01-01)
  • On the complexity of vertex-coloring edge-weightings
    by: Andrzej Dudek, et al.
    Published: (2011-11-01)
  • Gray codes avoiding matchings
    by: Darko Dimitrov, et al.
    Published: (2009-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