A note on 3-choosability of planar graphs without certain cyclesLI ZHANG; BAOYINDURENG WU.Discrete mathematics. 2005, Vol 297, Num 1-3, pp 206-209, issn 0012-365X, 4 p.Article

Some sufficient conditions for a planar graph of maximum degree six to be Class 1YUEHUA BU; WEIFAN WANG.Discrete mathematics. 2006, Vol 306, Num 13, pp 1440-1445, issn 0012-365X, 6 p.Article

(3, 3)-Linked planar graphsMORI, Ryuichi.Discrete mathematics. 2008, Vol 308, Num 22, pp 5280-5283, issn 0012-365X, 4 p.Article

Decomposing a planar graph with girth at least 8 into a forest and a matchingYINGQIAN WANG; QIJUN ZHANG.Discrete mathematics. 2011, Vol 311, Num 10-11, pp 844-849, issn 0012-365X, 6 p.Article

On 3-colorable planar graphs without prescribed cyclesWEIFAN WANG; MIN CHEN.Discrete mathematics. 2007, Vol 307, Num 22, pp 2820-2825, issn 0012-365X, 6 p.Article

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosableYINGQIAN WANG; HUAJING LU; MING CHEN et al.Discrete mathematics. 2010, Vol 310, Num 1, pp 147-158, issn 0012-365X, 12 p.Article

Choosability of the square of planar subcubic graphs with large girthHAVET, F.Discrete mathematics. 2009, Vol 309, Num 11, pp 3553-3563, issn 0012-365X, 11 p.Article

Optimal 1-planar graphs which triangulate other surfacesSUZUKI, Yusuke.Discrete mathematics. 2010, Vol 310, Num 1, pp 6-11, issn 0012-365X, 6 p.Article

A note on rectilinear and polar visibility graphsHUTCHINSON, Joan P.Discrete applied mathematics. 2005, Vol 148, Num 3, pp 263-272, issn 0166-218X, 10 p.Article

On the 3-colorability of planar graphs without 4-, 7- and 9-cyclesHUAJING LU; YINGQIAN WANG; WEIFAN WANG et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4596-4607, issn 0012-365X, 12 p.Article

A bond percolation critical probability determination based on the star-triangle transformationWIERMAN, J. C.Journal of physics. A, mathematical and general. 1984, Vol 17, Num 7, pp 1525-1530, issn 0305-4470Article

Efficient generation of plane triangulations without repetitionsZHANGJIAN LI; NAKANO, Shin-Ichi.Lecture notes in computer science. 2001, pp 433-443, issn 0302-9743, isbn 3-540-42287-0Conference Paper

The interval number of a planar graph: three intervals sufficeSCHEINERMAN, E. R; WEST, D. B.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 224-239, issn 0095-8956Article

A characterization of planar graphs by Trémaux ordersDE FRAYSSEIX, H; ROSENSTIEHL, P.Combinatorica (Print). 1985, Vol 5, Num 2, pp 127-135, issn 0209-9683Article

On the succint representation of graphsTURAN, G.Discrete applied mathematics. 1984, Vol 8, Num 3, pp 289-294, issn 0166-218XArticle

Re-embedding structures of 5-connected projective-planar graphsKITAKUBO, Shigeru; NEGAMI, Seiya.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 211-221, issn 0012-365XConference Paper

Fundamental group and cycle space of dual graphs and applicationsJARADAT, M. M. M.Applied mathematics and computation. 2010, Vol 217, Num 2, pp 580-582, issn 0096-3003, 3 p.Article

Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorableDINGZHU DU; LAN SHEN; YINGQIAN WANG et al.Discrete applied mathematics. 2009, Vol 157, Num 13, pp 2778-2784, issn 0166-218X, 7 p.Article

Subgraphs of 4-Regular Planar GraphsDOWDEN, Chris; ADDARIO-BERRY, Louigi.Algorithmica. 2011, Vol 61, Num 3, pp 758-776, issn 0178-4617, 19 p.Article

PLANAR GRAPHS WITHOUT 7-CYCLES ARE 4-CHOOSABLEFARZAD, Babak.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 3, pp 1179-1199, issn 0895-4801, 21 p.Article

An O (n log n) Algorithm for Maximum st-Flow in a Directed Planar GraphBORRADAILE, Glencora; KLEIN, Philip.Journal of the Association for Computing Machinery. 2009, Vol 56, Num 2, issn 0004-5411, 9.1-9.30Article

A non-3-choosable planar graph without cycles of length 4 and 5VOIGT, M.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 1013-1015, issn 0012-365X, 3 p.Conference Paper

Listing all the minimal separators of a 3-connected planar graphMAZOIT, F.Discrete mathematics. 2006, Vol 306, Num 3, pp 372-380, issn 0012-365X, 9 p.Article

Acyclic chromatic indices of planar graphs with girth at least fiveQIAOJUN SHU; WEIFAN WANG.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 140-157, issn 1382-6905, 18 p.Article

Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosableYINGQIAN WANG; QIAN WU; LIANG SHEN et al.Discrete applied mathematics. 2011, Vol 159, Num 4, pp 232-239, issn 0166-218X, 8 p.Article