Computing the Scattering Number of Graphs (Q4780531): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sheng Gui Zhang / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
Normal rank
 
Property / author
 
Property / author: Sheng Gui Zhang / rank
 
Normal rank
Property / author
 
Property / author: Xue Liang Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160211919 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092855865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalogue of small maximal nonhamiltonian 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: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐tenacious networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number in graphs / rank
 
Normal rank

Latest revision as of 17:47, 4 June 2024

scientific article; zbMATH DE number 1833102
Language Label Description Also known as
English
Computing the Scattering Number of Graphs
scientific article; zbMATH DE number 1833102

    Statements

    Computing the Scattering Number of Graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2003
    0 references
    scattering number
    0 references
    NP-complete problem
    0 references
    grid
    0 references
    hypercube
    0 references

    Identifiers