\((k,g)\)-cages are 3-connected (Q1297446): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q215558
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Peter Horák / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of cages / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the order of cages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cages—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242926 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(98)00342-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979376805 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
\((k,g)\)-cages are 3-connected
scientific article

    Statements

    \((k,g)\)-cages are 3-connected (English)
    0 references
    0 references
    0 references
    5 December 1999
    0 references
    A \(k\)-regular graph of girth \(g\) which has the smallest number of vertices among all \(k\)-regular graphs of girth \(g\) is called a \((k,g)\)-cage. The authors show that all cages are 3-connected.
    0 references
    0 references
    connectivity
    0 references
    cage
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references