N‐extendability of symmetric graphs (Q4693362): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190170213 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117515252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs / rank
 
Normal rank

Latest revision as of 17:22, 17 May 2024

scientific article; zbMATH DE number 205329
Language Label Description Also known as
English
N‐extendability of symmetric graphs
scientific article; zbMATH DE number 205329

    Statements

    N‐extendability of symmetric graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 February 1994
    0 references
    0 references
    extendability
    0 references
    symmetric graphs
    0 references
    edge transitive graph
    0 references
    matching
    0 references
    0 references