2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes, graphs, and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number and extremal non-Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective-planar graphs are Hamiltonian-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-hamiltonian cubes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the vulnerability for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 1-hamiltonian-connected cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Class of Hypohamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimumk-hamiltonian graphs, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton cycles in certain planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity, genus, and the number of components in vertex-deleted subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-connected toroidal graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton paths in toroidal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypohamiltonian and hypotraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MinimumK-hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths, planarizing cycles, and spanning walks / rank
 
Normal rank

Latest revision as of 19:15, 8 July 2024

scientific article
Language Label Description Also known as
English
2-edge-Hamiltonian-connectedness of 4-connected plane graphs
scientific article

    Statements

    2-edge-Hamiltonian-connectedness of 4-connected plane graphs (English)
    0 references
    0 references
    0 references
    29 July 2014
    0 references
    2-edge-Hamiltonian-connected graph
    0 references
    Hamiltonian cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references