Toughness and Hamiltonicity of a class of planar graphs (Q1883251): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866156 / 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: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / 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: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / 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: A 1-tough nonhamiltonian maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518404 / 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

Latest revision as of 11:16, 7 June 2024

scientific article
Language Label Description Also known as
English
Toughness and Hamiltonicity of a class of planar graphs
scientific article

    Statements

    Identifiers