Michael J. Dinneen - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged planar graph

Planarity of iterated line graphsMohammad Ghebleh, Mahdad Khatirinejad. DM, 308(1):144-147, 2008. [doi]

Covering planar graphs with forests, one having a bounded maximum degreeD. Gonçalves. endm, 31:161-165, 2008. [doi]

Exponentially many 5-list-colorings of planar graphsCarsten Thomassen. JCT, 97(4):571-583, 2007. [doi]

Each maximal planar graph with exactly two separating triangles is HamiltonianGuido Helden. DAM, 155(14):1833-1836, 2007. [doi]

MacLane s planarity criterion for locally finite graphsHenning Bruhn, Maya Jakobine Stein. JCT, 96(2):225-239, 2006. [doi]

Hard coloring problems in low degree planar bipartite graphsMiroslav Chlebík, Janka Chlebíková. DAM, 154(14):1960-1965, 2006. [doi]

Rectangular and visibility representations of infinite planar graphsCarsten Thomassen. jgt, 52(3):257-265, 2006. [doi]

On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulationCarsten Thomassen. jgt, 53(4):261-269, 2006. [doi]

Algorithms for Inner Magic and Inner Antimagic Labelings of Some Planar GraphsAuparajita Krishnaa, Manohar Singh Dulawat. informaticaLT, 17(3):393-406, 2006. [doi]

Hamilton cycles in maximal planar graphsGuido Helde, Oliver Vieten. endm, 25:71, 2006. [doi]

Bounded-Degree Independent Sets in Planar GraphsTherese C. Biedl, Dana F. Wilkinson. mst, 38(3):253-278, 2005. [doi]

A successful concept for measuring non-planarity of graphs: the crossing numberLászló A. Székely. DM, 276(1-3):331-352, 2004. [doi]

A Characterization of Planar Graphs by Pseudo-Line ArrangementsTakeshi Hisao. algorithmica, 35(3):269-285, 2003. [doi]

Choosability and edge choosability of planar graphs without five cyclesWeifan Wang, Ko-Wei Lih. appml, 15(5):561-565, 2002. [doi]

Arithmetic progressions of cycles in outer-planar graphsTristan Denley. DM, 249(1-3):65-70, 2002. [doi]

Embedding Vertices at Points: Few Bends Suffice for Planar GraphsMichael Kaufmann, Roland Wiese. jgaa, 6(1):115-129, 2002. [doi]

K::6:: and icosahedron minors in 5-connected projective planar graphsGasper Fijavz. endm, 5:116-119, 2000. [doi]

Equilateral Drawing of 2-Connected Planar Chordal GraphsLilian Markenzon, N. Paciornik. endm, 3:128-132, 1999. [doi]

On The Number Of Simple Cycles In Planar GraphsHelmut Alt, Ulrich Fuchs, Klaus Kriegel. cpc, 8(5):397-405, 1999.

Embedding Vertices at Points: Few Bends Suffice for Planar GraphsMichael Kaufmann, Roland Wiese. gd 1999: 165-174 [doi]

On uniquely partitionable planar graphsPeter Mihók, Jozef Bucko, Margit Voigt. DM, 191(1-3):149-158, 1998. [doi]

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional GridYanpei Liu, Aurora Morgana, Bruno Simeone. DAM, 81(1-3):69-91, 1998. [doi]

Subgraphs with restricted degrees of their vertices in planar graphsIgor Fabrici, Stanislav Jendrol. DM, 191(1-3):83-90, 1998. [doi]

Edge-Packing in Planar GraphsLenwood S. Heath, John Paul C. Vergara. mst, 31(6):629-662, 1998. [doi]

Hamilton Cycles in Planar Graphs and Venn DiagramsKiran B. Chilakamarri, Peter Hamburger, Raymond E. Pippert. JCT, 67(2):296-303, 1996. [doi]

Bounded Combinatorial Width and Forbidden SubstructuresMichael J. Dinneen. PhD thesis, Dept. of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., Canada~~V8W~3P6, dec 1995.

Paths and Metrics in a Planar Graph with Three or More Holes. I. MetricsAlexander V. Karzanov. JCT, 60(1):1-18, 1994. [doi]

Paths and Metrics in a Planar Graph with Three or More Holes. II. PathsAlexander V. Karzanov. JCT, 60(1):19-35, 1994. [doi]

2-Connected Spanning Subgraphs of Planar 3-Connected GraphsDavid W. Barnette. JCT, 61(2):210-216, 1994. [doi]

Hajós conjecture and small cycle double covers of planar graphsKaren Seyffarth. DM, 101(1-3):291-306, 1992. [doi]

A Deterministic Parallel Algorithm for Planar Graphs IsomorphismHillel Gazit. focs 1991: 723-732

Disjoint Homotopic Paths and Trees in a Planar GraphAlexander Schrijver. dcg, 6:527-574, 1991.

The pagewidth of trivalent planar graphsElena Stöhr. DM, 89(1):43-49, 1991. [doi]

On 4-critical planar graphs with high edge densityGerhard Koester. DM, 98(2):147-151, 1991. [doi]

Finding Hamiltonian Cycles in Certain Planar GraphsRobert J. Cimikowski. ipl, 35(5):249-254, 1990.

Edge-disjoint homotopic paths in a planar graph with one holeC. P. M. van Hoesel, Alexander Schrijver. JCT, 48(1):77-91, 1990. [doi]

Finding Steiner Forests in Planar GraphsHitoshi Suzuki, Takehiro Akama, Takao Nishizeki. soda 1990: 444-453

On spanning subgraphs of 4-connected planar graphsMoshe Rosenfeld. DAM, 25(3):279-287, 1989. [doi]

On the Complexity of Covering Vertices by Faces in a Planar GraphDaniel Bienstock, Clyde L. Monma. SICOMP, 17(1):53-76, 1988.

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 verticesDerek A. Holton, Brendan D. McKay. JCT, 45(3):305-319, 1988. [doi]

Labeling angles of planar graphsFeodor Loupekine, John J. Watkins. DM, 72(1-3):251-256, 1988. [doi]

A Parallel Algorithm for Finding a Separator in Planar GraphsHillel Gazit, Gary L. Miller. focs 1987: 238-248

Degree Bounds and Subhamiltonian Cycles in Planar GraphsFrank Bauernöppel. eik, 23(10/11):529-536, 1987.

Hamiltonian cycles in cubic 3-connected bipartite planar graphsDerek A. Holton, Bennet Manvel, Brendan D. McKay. JCT, 38(3):279-297, 1985. [doi]

A counterexample to the conjecture of Aksionov and Mel nikov on non-3-colorable planar graphsHan-Kun Ma. JCT, 36(2):218-219, 1984. [doi]

On k-path hamiltonian maximal planar graphsIlker Baybars. DM, 40(1):119-121, 1982. [doi]

The reconstruction of maximal planar graphs. I. RecognitionS. Fiorini, Josef Lauri. JCT, 30(2):188-195, 1981. [doi]

The reconstruction of maximal planar graphs II. ReconstructionJosef Lauri. JCT, 30(2):196-214, 1981. [doi]

Planar graphs with square or cube root are four-colorableS. Ramachandran. JCT, 24(3):362-364, 1978. [doi]

A V log V Algorithm for Isomorphism of Triconnected Planar GraphsJohn E. Hopcroft, Robert Endre Tarjan. jcss, 7(3):323-331, 1973.

runs on WebDSL