4-Connected Projective-Planar Graphs Are Hamiltonian

No abstract is available for this paper.

• Publication year

  1994

• Venue

  J. Comb. Theory B

• Publication date

  1994-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1006/jctb.1994.1058
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A theorem on paths in planar graphs

  1986cited by this paper
• A theorem on paths in planar graphs

  1983influential reference
• Polytopes, graphs, and complexes

  1970cited by this paper
• A THEOREM ON PLANAR GRAPHS

  1956cited by this paper
• A Theorem on Graphs

  1931cited by this paper

• Hamiltonicity of optimal 2-planar graphs

  2025cites this paper
• On minimal k-factor-critical planar graphs

  2025cites this paper
• The Price of Connectivity Augmentation on Planar Graphs

  2025cites this paper
• On minors of non-hamiltonian graphs

  2025cites this paper
• The decycling number of a line graph

  2025cites this paper
• Proof of a conjecture of Voss on bridges of longest cycles

  2025cites this paper
• Long Cycles and Spectral Radii in Planar Graphs

  2024cites this paper
• Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles

  2024cites this paper
• Partitioning a Planar Graph into two Triangle-Forests

  2024cites this paper
• 4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected

  2024cites this paper
• Two classes of connectivity-related non-Hamiltonian 1-planar perfect graphs

  2024influential citation
• Pancyclicity of almost-planar graphs

  2024cites this paper
• Distribution of subtree sums

  2023cites this paper
• K2‐Hamiltonian graphs: II

  2023cites this paper
• Tutte paths and long cycles in circuit graphs

  2022cites this paper
• Counting cycles in planar triangulations

  2022influential citation
• Generating punctured surface triangulations with degree at least 4

  2022cites this paper
• On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs

  2022cites this paper
• On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs

  2021cites this paper
• Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs

  2021cites this paper
• K2-Hamiltonian Graphs: I

  2021influential citation
• On Tutte Cycles Containing Three Prescribed Edges

  2021cites this paper
• Counting Hamiltonian cycles in planar triangulations

  2021cites this paper
• Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators

  2021cites this paper
• Number of Hamiltonian Cycles in Planar Triangulations

  2021influential citation
• Hamiltonicity of doubly semi-equivelar maps on the torus

  2021cites this paper
• Cycles in 5-connected triangulations

  2020cites this paper
• Rooted minors and locally spanning subgraphs

  2020cites this paper
• Non-hamiltonian 1-tough triangulations with disjoint separating triangles

  2020cites this paper
• Cycle Traversability for Claw-Free Graphs and Polyhedral Maps

  2020cites this paper
• Edge proximity and matching extension in projective planar graphs

  2020cites this paper
• Cycles through a set of specified vertices of a planar graph

  2019cites this paper
• Chords of Longest Circuits of Graphs by Xuechao

  2019cites this paper
• [a, B]-factors of Graphs on Surfaces

  2019cites this paper
• T . Biedl and P . Kindermann 23 : 3 Hamiltonian paths and Tutte paths

  2019cites this paper
• Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks

  2019cites this paper
• Are highly connected 1-planar graphs Hamiltonian?

  2019cites this paper
• Find subtrees of specified weight and cycles of specified length in linear time

  2019cites this paper
• Jul 16, 2021 Cycles

  2019cites this paper
• Subtrees search, cycle spectra and edge-connectivity structures

  2019cites this paper
• Book Embedding of Graphs on the Projective Plane

  2019cites this paper
• Types of triangle in Hamiltonian triangulations and an application to domination and k-walks

  2019cites this paper
• Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs

  2019cites this paper
• Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A Survey

  2018cites this paper
• Non-hamiltonian triangulations with distant separating triangles

  2018cites this paper
• Hamiltonian properties of polyhedra with few 3-cuts - A survey

  2018cites this paper
• Cycle Traversability for Claw-Free Graphs and Polyhedral Maps

  2018cites this paper
• Finding Tutte paths in linear time

  2018cites this paper
• Cubic vertices in planar hypohamiltonian graphs

  2018cites this paper
• Every 4-Connected Graph with Crossing Number 2 is Hamiltonian

  2018influential citation
• C O ] 4 J un 2 01 8 Polyhedra with few 3-cuts are hamiltonian

  2018cites this paper
• The Matching Extendability of Optimal 1-Planar Graphs

  2018cites this paper
• Graph Embeddings Motivated by Greedy Routing

  2018cites this paper
• Two Results in Drawing Graphs on Surfaces

  2018cites this paper
• Hitting all longest cycles in a graph

  2017cites this paper
• Computing Tutte Paths

  2017influential citation
• Spanning closed walks with bounded maximum degrees of graphs on surfaces

  2017cites this paper
• Types of triangle and the impact on domination and k-walks

  2017cites this paper
• 2 The strategy of the proofs of Theorem 1

  2016cites this paper
• A Strengthening of a Theorem of Tutte on Hamiltonicity of Polyhedra

  2016influential citation
• 5-Connected Toroidal Graphs are Hamiltonian-Connected

  2016influential citation
• Hamiltonicity of planar graphs with a forbidden minor

  2016cites this paper
• Polyhedra with Few 3-Cuts are Hamiltonian

  2016cites this paper
• Cyclic properties of the topological graphs of hexagonal grids

  2015cites this paper
• Cyclic properties of the topological graphs of hexagonal grids

  2015cites this paper
• Every 5-connected planar triangulation is 4-ordered Hamiltonian

  2015cites this paper
• One‐way infinite 2‐walks in planar graphs

  2015cites this paper
• Equivalence of Jackson's and Thomassen's conjectures

  2015cites this paper
• Relationship Among Triangulations, Quadrangulations and Optimal $$1$$1-Planar Graphs

  2015cites this paper
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs

  2014cites this paper
• A shorter proof of Thomassen’s theorem on Tutte paths in plane graphs

  2014cites this paper
• Representation of enclosing surfaces from simple voxelized objects by means of a chain code

  2014cites this paper
• Combinatorial Properties of Polyiamonds

  2014cites this paper
• Recent Advances on the Hamiltonian Problem: Survey III

  2014cites this paper
• 3 0 A ug 2 01 3 Hamiltonian Cycle in Semi-Equivelar Maps on the Torus Dipendu Maity

  2014cites this paper
• Hamiltonicity and structure of classes of minor-free graphs

  2014cites this paper
• Alliances and Bisection Width for Planar Graphs

  2013cites this paper
• Hamiltonian Cycle in Semi-Equivelar Maps on the Torus

  2013cites this paper
• 9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)

  2013influential citation
• Criticality of Counterexamples to Toroidal Edge-Hamiltonicity

  2013cites this paper
• Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks

  2013cites this paper
• On Alliance Partitions and Bisection Width for

  2013cites this paper
• Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices

  2013cites this paper
• Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces

  2013cites this paper
• 4-connected projective-planar graphs are Hamiltonian-connected

  2013cites this paper
• Hamiltonian cycles in bipartite quadrangulations on the torus

  2012cites this paper
• Geometric algorithms for sensor networks

  2012cites this paper
• Evolutionary Hamiltonian Graph Theory

  2012cites this paper
• Spanning closed walks and TSP in 3-connected planar graphs

  2012cites this paper
• Hamilton cycles in 4-connected troidal triangulations

  2011influential citation
• Tight bounds for linkages in planar graphs

  2011cites this paper
• 2‐ and 3‐factors of graphs on surfaces

  2011cites this paper
• Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs

  2010cites this paper
• The 2-extendability of 5-connected graphs on the Klein bottle

  2010cites this paper
• The 2-Extendability of Graphs on the Projective Plane, the Torus and the Klein Bottle

  2010cites this paper
• Geometric abstractions for information processing in sensor networks

  2010cites this paper
• What is on his mind?

  2010cites this paper
• A note on traversing specified vertices in graphs embedded with large representativity

  2010cites this paper
• Long cycles in 4-connected planar graphs

  2009cites this paper
• The Circumference of a Graph with no K 3 , t-minor , II

  2009cites this paper