An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs (Q1690216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963364355 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.09475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: More than one tough chordal planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the shortness exponent of 1-tough, maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and nonhamiltonicity of polyhedral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple paths on polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness parameters for polyhedral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortness exponent of 1-tough, maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:21, 14 July 2024

scientific article
Language Label Description Also known as
English
An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
scientific article

    Statements

    Identifiers

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