Minimal Cyclic-4-Connected Graphs

DOI10.2307/1999101MaRDI QIDQ3338281zbMATH OpenOpenAlexFDO

Authors Neil Robertson

Publication date 1984

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1999101

zbMATH Keywords

minimal graphscyclic-connectivity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Recommendations

• Uncontractable 4-connected graphs
• Minimally 3-connected graphs
• Characterization of cyclically-4-connected cubic graphs without \(K_{4,4}\)-minor
• On the decomposition of a 3-connected graph into cyclically 4-edge-connected components
• Cyclic Matroids

Cited in

(26)

• Vulnerability assessment of a new class of Cayley graph
• Super cyclically edge connected transitive graphs
• Decomposition of 3-connected graphs
• Link fault tolerability of the Cartesian product power graph (K₉ -C₉)^n: conditional edge-connectivities under six link fault patterns
• On cyclic edge-connectivity of transitive graphs
• Minimally 3-connected graphs
• Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
• Four-cycled graphs with topological applications
• Minimally 4-edge\(^ \#\)-connected graphs
• Cubic graphs with no short cycle covers
• The cyclic diagnosability of star graphs under the PMC and MM* models
• Minimal non-selfcentric radially-maximal graphs of radius 4
• Fault tolerability analysis of hypercubes based on the g-cyclic fault pattern
• The cyclic diagnosability of balanced hypercubes under the \textit{PMC} and \(MM^\ast\) model
• Characterization of cyclically-4-connected cubic graphs without \(K_{4,4}\)-minor
• Decomposition of cubic graphs with cyclic connectivity 5
• Characterizations of p-groups whose power graphs satisfy certain connectivity conditions
• The smallest nontrivial snarks of oddness 4
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• Characterization of graphs with infinite cyclic edge connectivity
• Cyclic connectivity and cyclic diagnosability of data center network DCell
• scientific article; zbMATH DE number 4185643 (Why is no real title available?)
• The cyclic diagnosability of (n, k)-star graphs under the PMC and MM* models
• Generating internally four-connected graphs
• New minimal (4; n)-regular matchstick graphs
• Uncontractable 4-connected graphs

This page was built for publication: Minimal Cyclic-4-Connected Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3338281)