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

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

zbMATH Keywords

connectivity

0 references

cage

0 references

reviewed by

Peter Horák

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3899969

0 references

Connectivity of cages

0 references

New upper bounds on the order of cages

0 references

Cages—a survey

0 references

Q4242926

0 references

full work available at URL

https://doi.org/10.1016/s0012-365x(98)00342-2

0 references

Identifiers

zbMATH Open document ID

0927.05050

0 references

DOI

10.1016/S0012-365X(98)00342-2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1297446

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3899969
@@ Property / cites work: Q3899969 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity of cages
@@ Property / cites work: Connectivity of cages / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds on the order of cages
@@ Property / cites work: New upper bounds on the order of cages / rank @@
+Normal rank
@@ Property / cites work @@
+Cages—a survey
@@ Property / cites work: Cages—a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242926
@@ Property / cites work: Q4242926 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0012-365x(98)00342-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1979376805
@@ Property / OpenAlex ID: W1979376805 / rank @@
+Normal rank