Edge reductions in cyclically k-connected cubic graphs
From MaRDI portal
Publication:922553
DOI10.1016/0095-8956(92)90004-HzbMATH Open0711.05030OpenAlexW2038044706MaRDI QIDQ922553FDOQ922553
Authors: William McCuaig 
Publication date: 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(92)90004-h
Recommendations
- Cycles through edges in cyclically \(k\)-connected cubic graphs
- Algorithm Theory - SWAT 2004
- Uniform cyclic edge connectivity in cubic graphs
- A polynomial algorithm for cyclic edge connectivity of cubic graphs
- On the cyclabilitiy of some cube graphs
- Cycles in cube-connected cycles graphs
- scientific article; zbMATH DE number 4010555
- On the number of cycles in 3-connected cubic graphs
- Vertex-edge domination in cubic graphs
Cites Work
- Graph theory with applications
- Title not available (Why is that?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Construction of class two graphs with maximum vertex degree three
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Hamiltonian Circuits
- Title not available (Why is that?)
- Decomposition of 3-connected cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On generating planar graphs
- The maximum genus of vertex-transitive graphs
- Title not available (Why is that?)
- A non-Hamiltonian planar graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
Cited In (27)
- The cyclic edge-connectivity of strongly regular graphs
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- The k-conversion number of regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The cubic graphs with finite cyclic vertex connectivity larger than girth
- Generating \(r\)-regular graphs
- Graphs with no \(\bar{P}_7\)-minor
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- The number of removable edges in 3-connected graphs
- Cyclically five-connected cubic graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- Reducible 3-critical graphs
- Splitter Theorems for Cubic Graphs
- Coverings of cubic graphs and 3-edge colorability
- Topological minors in line graphs -- a proof of Zha's conjecture
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Algorithm Theory - SWAT 2004
- Cycles through edges in cyclically \(k\)-connected cubic graphs
- The Nash-Williams conjecture and the dominating cycle conjecture
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes
- Excluded minors in cubic graphs
- On 3-cut reductions of minimally 1-factorable cubic bigraphs
- The minimality of the Georges-Kelmans graph
This page was built for publication: Edge reductions in cyclically \(k\)-connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922553)
