DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Ilkyoo | ko |
dc.contributor.author | Ekstein, Jan | ko |
dc.contributor.author | Holub, Přemysl | ko |
dc.contributor.author | Lidický, Bernard | ko |
dc.date.accessioned | 2023-11-03T01:00:56Z | - |
dc.date.available | 2023-11-03T01:00:56Z | - |
dc.date.created | 2023-11-03 | - |
dc.date.issued | 2014-10 | - |
dc.identifier.citation | 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, pp.98 - 109 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/314164 | - |
dc.description.abstract | Given 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.language | English | - |
dc.publisher | Springer Verlag | - |
dc.title | 3-coloring triangle-free planar graphs with a precolored 9-cycle | - |
dc.type | Conference | - |
dc.identifier.wosid | 000365044500009 | - |
dc.identifier.scopusid | 2-s2.0-84937403566 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 98 | - |
dc.citation.endingpage | 109 | - |
dc.citation.publicationname | 25th International Workshop on Combinatorial Algorithms, IWOCA 2014 | - |
dc.identifier.conferencecountry | US | - |
dc.identifier.conferencelocation | Duluth, MN | - |
dc.identifier.doi | 10.1007/978-3-319-19315-1_9 | - |
dc.contributor.localauthor | Choi, Ilkyoo | - |
dc.contributor.nonIdAuthor | Ekstein, Jan | - |
dc.contributor.nonIdAuthor | Holub, Přemysl | - |
dc.contributor.nonIdAuthor | Lidický, Bernard | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.