\((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

Mathematics Subject Classification ID

05C40

0 references

zbMATH DE Number

1321804

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

Q4333460

0 references

New upper bounds on the order of cages

0 references

Cages—a survey

0 references

Q4242926

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1297446

@@ Property / reviewed by @@
-Peter Horák
@@ Property / reviewed by: Peter Horák / rank @@
-Normal rank
@@ Property / reviewed by @@
+Peter Horák
@@ Property / reviewed by: Peter Horák / rank @@
+Normal rank
@@ 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 @@
+Q4333460
@@ Property / cites work: Q4333460 / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:1297446