http://researchonline.federation.edu.au/vital/access/manager/Index ${session.getAttribute("locale")} 5 All (k;g)-cages are k-edge-connected http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:524 Wed 07 Apr 2021 13:31:27 AEST ]]> Improved lower bound for the vertex connectivity of (delta;g)-cages http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:522 = root(delta + 1) for g >= 7 odd. This result supports the conjecture of Fu, Huang and Rodger that all (delta; g)-cages are delta-connected. (c) 2005 Elsevier B.V. All rights reserved.]]> Wed 07 Apr 2021 13:31:27 AEST ]]> On the connectivity of (k, g)-cages of even girth http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:521 Wed 07 Apr 2021 13:31:27 AEST ]]> A lower bound on the order of regular graphs with given girth pair http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:94 Wed 07 Apr 2021 13:30:55 AEST ]]> A new proof of Balinski's theorem on the connectivity of polytopes http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:15160 Tue 23 Nov 2021 14:51:11 AEDT ]]> Connectivity of cubical polytopes http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:14273 = 3, the graph of a cubical d-polytope with minimum degree 5 is min{delta, 2d - 2}-connected. Second, we show, for any d >= 4, that every minimum separator of cardinality at most 2d - 3 in such a graph consists of all the neighbours of some vertex and that removing the vertices of the separator from the graph leaves exactly two components, with one of them being the vertex itself. (C) 2019 Elsevier Inc. All rights reserved.]]> Tue 21 Dec 2021 09:27:27 AEDT ]]>