Toughness and binding number (Q2448921): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3789603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of recognizing tough cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the binding number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Toughness of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank

Latest revision as of 11:21, 8 July 2024

scientific article
Language Label Description Also known as
English
Toughness and binding number
scientific article

    Statements

    Toughness and binding number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    binding number
    0 references
    toughness
    0 references

    Identifiers