Contractible edges in 3-connected graphs
From MaRDI portal
Publication:1087557
DOI10.1016/0095-8956(87)90065-7zbMath0611.05037OpenAlexW2033985129MaRDI QIDQ1087557
Hikoe Enomoto, Akira Saito, Kiyoshi Ando
Publication date: 1987
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(87)90065-7
Related Items (42)
Contractible edges in triangle-free graphs ⋮ Contractible edges in longest cycles in non-Hamiltonian graphs ⋮ Reduction for 3-connected graphs of minimum degree at least four ⋮ On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ Minimal locally cyclic triangulations of the projective plane ⋮ The 3‐connected graphs with a maximum matching containing precisely one contractible edge ⋮ Removable edges in cyclically 4-edge-connected cubic graphs ⋮ Non-contractible edges in a 3-connected graph ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ The number of contractible edges in 3-connected graphs ⋮ A longest cycle version of Tutte's wheels theorem ⋮ A remark on the connectivity of the complement of a 3-connected graph ⋮ On contractible and vertically contractible elements in 3-connected matroids and graphs ⋮ Contractible Edges in 3-Connected Cubic Graphs ⋮ Non-contractible non-edges in 2-connected graphs ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ A splitter theorem on 3-connected matroids ⋮ Splitting and contractible edges in 4-connected graphs ⋮ An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs ⋮ Properly 3-contractible edges in a minimally 3-connected graph ⋮ Non-separating cycles and discrete Jordan curves ⋮ Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)] ⋮ On the number of contractible triples in 3-connected graphs ⋮ Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge ⋮ On 3-connected graphs with contractible edge covers of size \(k\) ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ Another step towards proving a conjecture by Plummer and Toft ⋮ On obstructions to small face covers in planar graphs ⋮ An extremal problem on contractible edges in 3-connected graphs ⋮ Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \) ⋮ Contractible edges in 3-connected graphs that preserve a minor ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Distribution of contractible edges in k-connected graphs ⋮ Contractible edges and contractible triangles in a 3-connected graph ⋮ Contractible non-edges in \(3\)-connected graphs ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ Unnamed Item ⋮ On the Structure of Contractible Vertex Pairs in Chordal Graphs ⋮ Excluding a ladder ⋮ Contractible subgraphs in 3-connected graphs ⋮ Coloring the faces of convex polyhedra so that like colors are far apart ⋮ Contractible and removable edges in 3-connected infinite graphs
Cites Work
This page was built for publication: Contractible edges in 3-connected graphs
