A necessary and sufficient condition for a graph to be edge tenacious (Q5936066)

From MaRDI portal
Revision as of 23:56, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127098063, #quickstatements; #temporary_batch_1722465628192)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1612927
Language Label Description Also known as
English
A necessary and sufficient condition for a graph to be edge tenacious
scientific article; zbMATH DE number 1612927

    Statements

    title
    A necessary and sufficient condition for a graph to be edge tenacious (English)
    0 references
    author
    Zhiping Wang
    0 references
    Lian-Chang Zhao
    0 references
    publication date
    14 May 2002
    0 references
    review text
    The authors give a necessary and sufficient condition for a graph to be edge-tenacious. This result is used to prove that every complete \(n\)-partitite graph is strictly edge-tenacious.
    0 references
    zbMATH Keywords
    connectivity
    0 references
    edge-tenacious
    0 references

    Identifiers

    zbMATH DE Number
    1612927
    0 references
    OpenAlex ID
    W1969240536
    0 references
    Wikidata QID
    Q127098063
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5936066&oldid=37510613"
    Powered by MediaWiki