3-coloring triangle-free planar graphs with a precolored 9-cycle

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 61
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorChoi, Ilkyooko
dc.contributor.authorEkstein, Janko
dc.contributor.authorHolub, Přemyslko
dc.contributor.authorLidický, Bernardko
dc.date.accessioned2023-11-03T01:00:56Z-
dc.date.available2023-11-03T01:00:56Z-
dc.date.created2023-11-03-
dc.date.issued2014-10-
dc.identifier.citation25th International Workshop on Combinatorial Algorithms, IWOCA 2014, pp.98 - 109-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10203/314164-
dc.description.abstractGiven a triangle-free planar graph G and a cycle C of length 9 in G, we characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results for the length of C up to 8.-
dc.languageEnglish-
dc.publisherSpringer Verlag-
dc.title3-coloring triangle-free planar graphs with a precolored 9-cycle-
dc.typeConference-
dc.identifier.wosid000365044500009-
dc.identifier.scopusid2-s2.0-84937403566-
dc.type.rimsCONF-
dc.citation.beginningpage98-
dc.citation.endingpage109-
dc.citation.publicationname25th International Workshop on Combinatorial Algorithms, IWOCA 2014-
dc.identifier.conferencecountryUS-
dc.identifier.conferencelocationDuluth, MN-
dc.identifier.doi10.1007/978-3-319-19315-1_9-
dc.contributor.localauthorChoi, Ilkyoo-
dc.contributor.nonIdAuthorEkstein, Jan-
dc.contributor.nonIdAuthorHolub, Přemysl-
dc.contributor.nonIdAuthorLidický, Bernard-
Appears in Collection
RIMS Conference Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0