Drawing outer-planar graphs in O(n log n) areaBIEDL, Therese.Lecture notes in computer science. 2002, pp 54-65, issn 0302-9743, isbn 3-540-00158-1, 12 p.Conference Paper

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

AUTOMASTICHE ABBILDUNG EINES PLANAREN GRAPHEN IN EINEN EBENEN STRECKENGRAPHEN = REPRESENTATION AUTOMATIQUE D'UN GRAPHE PLANAIRE COMME GRAPHE PLANAIRE TOPOLOGIQUEKOPPE R.1972; COMPUTING; AUSTR.; DA. 1972; VOL. 10; NO 4; PP. 317-333; ABS. ANGL.; BIBL. 10 REF.Serial Issue

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

Ising models on Feynman graphsCICUTA, G. M; MOLINARI, L; MONTALDI, E et al.Nuclear physics. B. 1988, Vol 300, Num 2, pp 197-206, issn 0550-3213Article

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

WAGNER'S THEOREM FOR TORUS GRAPHSDEWDNEY AK.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 2; PP. 139-149; BIBL. 3 REF.Serial Issue

Largest planar graphs and largest maximal planar graphs of diameter twoYUANSHENG YANG; JIANHUA LIN; YONGJIE DAI et al.Journal of computational and applied mathematics. 2002, Vol 144, Num 1-2, pp 349-358, issn 0377-0427Conference Paper

A LOWER BOUND FOR THE INDEPENDENCE NUMBER OF A PLANAR GRAPH.ALBERTSON MO.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 1; PP. 84-93; BIBL. 5 REF.Article

GRAPHES REGULIEREMENT REPRESENTABLES SUR LE TORE.NGUYEN HUY YUONG.1975; C.R. ACAD. SCI., A; FR.; DA. 1975; VOL. 281; NO 16; PP. 683-685; ABS. ANGL.; BIBL. 3 REF.Article

An efficient parallel algorithm for the general planar monotone circuit value problemVIJAYA RAMACHANDRAN; HONGHUA YANG.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 312-339, issn 0097-5397Article

BICYCLES ET DIAGONALES DES GRAPHES PLANAIRES.ROSENTIEHL P.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 365-383; BIBL. 9 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

ON SPANNING AND EXPANDING STARS.ZAMFIRESCU T.1974; ATTI ACCAD. SCI. IST. BOLOGNA, SCI. FIS., R.C.; ITAL.; DA. 1974; VOL. 1; NO 2; PP. 41-47; BIBL. 4 REF.Article

SUR UNE APPROCHE AU PROBLEME DE COLORATION DES GRAPHES PLANAIRES IDONETS GA.1972; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1972; NO 4; PP. 108-114; BIBL. 6 REF.Serial Issue

FINITE VERTEX-TRANSITIVE PLANAR GRAPHS OF THE REGULARITY DEGREE OR FIVE.ZELINKA B.1975; MAT. CAS.; CESKOSL.; DA. 1975; VOL. 25; NO 3; PP. 271-280; BIBL. 1 REF.Article

A linear algorithm for embedding planar graphs using PQ-treesCHIBA, N; NISHIZEKI, T; ABE, S et al.Journal of computer and system sciences (Print). 1985, Vol 30, Num 1, pp 54-76, issn 0022-0000Article

An O(|V|²) algorithm for the planar 3-cut problemHOCHBAUM, D. S; SHMOYS, D. B.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 4, pp 707-712, issn 0196-5212Article

Drawing graphs with large vertices and thick edgesBAREQUET, Gill; GOODRICH, Michael T; RILEY, Chris et al.Lecture notes in computer science. 2003, pp 281-293, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

On consecutive labeling of plane graphsBACA, M.Journal of the Franklin Institute. 1991, Vol 328, Num 2-3, pp 249-253, issn 0016-0032, 5 p.Article

Les hypercartes planaires sont des arbres très bien étiquetés = Planar hypermaps are well-labelled treesARQUES, D.Discrete mathematics. 1986, Vol 58, Num 1, pp 11-24, issn 0012-365XArticle

Removable cycles in planar graphsFLEISCHNER, H; JACKSON, B.Journal of the London Mathematical Society. 1985, Vol 31, Num 2, pp 193-199, issn 0024-6107Article

Unique and farthful embeddings of projective planar graphsNEGAMI, S.Journal of graph theory. 1985, Vol 9, Num 2, pp 235-243, issn 0364-9024Article