최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기European journal of combinatorics : Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik, v.68, 2018년, pp.38 - 65
Choi, Ilkyoo (Department of Mathematics, Hankuk University of Foreign Studies, Yongin-si, Gyeonggi-do 17035, Republic of Korea) , Ekstein, Jan (University of West Bohemia, Czech Republic) , Holub, Přemysl (University of West Bohemia, Czech Republic) , Lidický, Bernard (Iowa State University, USA)
Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results when C is a cycle of length at most 8. (C) 2017 Elsevier Ltd. All rights reserved....
Diskret. Analiz Aksenov Vyp. 26 Grafy i Testy 3 1974 The extension of a 3-coloring on planar graphs
Diskretn. Anal. Issled. Oper. Ser. 1 Aksenov 9 1 3 2002 On the continuation of a 3-coloring from two vertices in a plane graph without 3-cycles
Diskretn. Anal. Issled. Oper. Ser. 1 Aksenov 10 3 3 2003 Continuation of a 3-coloring from a 6-face to a plane graph without 3-cycles
Sib. Elektron. Mat. Izv. Aksenov 1 117 2004 Continuation of a 3-coloring from a 7-face onto a plane graph without 3-cycles
Illinois J. Math. Appel 21 3 429 1977 Every planar map is four colorable. I. Discharging
Illinois J. Math. Appel 21 3 491 1977 Every planar map is four colorable. II. Reducibility
Discrete Math. Borodin 169 1-3 177 1997 10.1016/0012-365X(95)00984-5 A new proof of Grunbaum’s 3 color theorem
Discrete Math. Borodin 313 4 517 2013 10.1016/j.disc.2012.11.011 Colorings of plane graphs: A survey
European J. Combin. Borodin 41 138 2014 10.1016/j.ejc.2014.03.009 Planar 4-critical graphs with four triangles
European J. Combin. Borodin 36 314 2014 10.1016/j.ejc.2013.05.002 Short proofs of coloring theorems on planar graphs
Choi vol. 8986 98 2015 Combinatorial Algorithms 3-coloring triangle-free planar graphs with a precolored 9-cycle
Discrete Math. Dailey 30 3 289 1980 10.1016/0012-365X(80)90236-8 Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
Z. Dvoak, K.-i. Kawarabayashi, Choosability of planar graphs of girth 5, 2011. ArXiv E-Prints http://arxiv.org/abs/1109.2976.
J. Combin. Theory Ser. B Dvoak 120 1 2016 10.1016/j.jctb.2016.04.003 Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
Z. Dvoak, D. Kral’, R. Thomas, Three-coloring triangle-free graphs on surfaces IV. 4-faces in critical graphs, 2014. Manuscript.
J. Graph Theory Dvoak 80 2 98 2014 10.1002/jgt.21842 3-coloring triangle-free planar graphs with a precolored 8-cycle
SIAM J. Discrete Math. Dvoak 28 1 521 2014 10.1137/130920952 4-critical graphs on surfaces without contractible (≤4)-cycles
Garey 1979 Computers and Intractability: A Guide to the Theory of NP-Completeness
Trans. Amer. Math. Soc. Gimbel 349 11 4555 1997 10.1090/S0002-9947-97-01926-0 Coloring graphs with fixed genus and girth
Math.-Natur. Reihe Grotzsch 8 109 1959 Ein dreifarbenzatz fur dreikreisfreie netze auf der kugel
Michigan Math. J. Grunbaum 10 303 1963 10.1307/mmj/1028998916 Grotzsch’s theorem on 3-colorings
J. Combin. Theory Ser. B Robertson 70 1 2 1997 10.1006/jctb.1997.1750 The four-colour theorem
J. Combin. Theory Ser. B Thomassen 87 1 38 2003 10.1016/S0095-8956(02)00027-8 The chromatic number of a graph of girth 5 on a fixed surface
Canad. J. Math. Tutte 6 80 1954 10.4153/CJM-1954-010-9 A contribution to the theory of chromatic polynomials
Walls 86 1999 Coloring Girth Restricted Graphs on Surfaces
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.