On the Toughness of Cycle Permutation Graphs (Q2760959): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4873795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4031776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification and toughness of generalized permutation star-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toughness of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3981352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank

Latest revision as of 21:47, 3 June 2024

scientific article
Language Label Description Also known as
English
On the Toughness of Cycle Permutation Graphs
scientific article

    Statements

    On the Toughness of Cycle Permutation Graphs (English)
    0 references
    0 references
    0 references
    16 December 2001
    0 references
    0 references
    cycle permutation graph
    0 references
    toughness
    0 references
    maximal chain
    0 references