Bridges and Hamiltonian circuits in planar graphs
From MaRDI portal
Publication:1237746
DOI10.1007/BF01837870zbMath0357.05039MaRDI QIDQ1237746
Publication date: 1977
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/136625
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
Tight bounds on maximal and maximum matchings, Spanning Eulerian subgraphs of bounded degree in triangulations, An extension of Whitney's theorem to infinite strong triangulations, One-way infinite Hamiltonian paths in infinite maximal planar graphs, Graph-theoretical conditions for inscribability and Delaunay realizability, A matrix characterization of induced paths in bridge graphs, Computing Tutte Paths, Gap strings and spanning forests for bridge graphs of biconnected graphs, Planarity and duality of finite and infinite graphs, A matrix analysis of carrier posets of biconnected graphs, Canonical forms for cycles in bridge graphs, Dynamic graph-based search in unknown environments, Planar Digraphs of Digirth Four are 2-Colorable, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Connectivity of plane triangulations, Cycles through specified vertices of a graph, Hamiltonicity in claw-free graphs, A linear-time algorithm for finding an ambitus, On matroid connectivity, Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs, Unnamed Item, Hamiltonian properties of polyhedra with few 3-cuts. A survey, Criticality of counterexamples to toroidal edge-Hamiltonicity, Maximal Hamiltonian cycles in squares of graphs, A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs, On Hamiltonian cycles in 4- and 5-connected plane triangulations, A generalization of outerplanar graphs
Cites Work
