Atoms of cyclic edge connectivity in regular graphs

DOI10.1007/S10878-014-9759-4zbMATH Open1341.90140OpenAlexW2071131583MaRDI QIDQ5963628FDOQ5963628

Jin-Xin Zhou

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9759-4

zbMATH Keywords

edge-transitive graphvertex-transitive graphcyclic edge connectivity\(\lambda_c\)-atom

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On computing a conditional edge-connectivity of a graph
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Title not available (Why is that?)
• Title not available (Why is that?)
• On conditional edge-connectivity of graphs
• Connectivity of transitive graphs
• Title not available (Why is that?)
• On restricted edge-connectivity of graphs.
• On cyclic edge-connectivity of transitive graphs
• On the 2-extendability of planar graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• Super cyclically edge connected transitive graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cyclic edge-cuts in fullerene graphs
• Infinitely many hypohamiltonian cubic graphs of girth 7
• \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)

Cited In (3)

• On the super (edge)-connectivity of generalized Johnson graphs
• On the reliability of modified bubble-sort graphs
• Some results about the reliability of folded hypercubes

This page was built for publication: Atoms of cyclic edge connectivity in regular graphs

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