Pages that link to "Item:Q1087557"

The following pages link to Contractible edges in 3-connected graphs (Q1087557):

Displaying 42 items.

• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302) (← links)
• Non-separating cycles and discrete Jordan curves (Q913818) (← links)
• Another step towards proving a conjecture by Plummer and Toft (Q960952) (← links)
• Contractible edges in triangle-free graphs (Q1085181) (← links)
• Removable edges in cyclically 4-edge-connected cubic graphs (Q1101466) (← links)
• The number of contractible edges in 3-connected graphs (Q1111571) (← links)
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\) (Q1175546) (← links)
• On 3-connected graphs with contractible edge covers of size \(k\) (Q1197021) (← links)
• On obstructions to small face covers in planar graphs (Q1204479) (← links)
• Distribution of contractible edges in k-connected graphs (Q1262876) (← links)
• Contractible edges in longest cycles in non-Hamiltonian graphs (Q1336689) (← links)
• A longest cycle version of Tutte's wheels theorem (Q1369899) (← links)
• On contractible and vertically contractible elements in 3-connected matroids and graphs (Q1377720) (← links)
• Splitting and contractible edges in 4-connected graphs (Q1400957) (← links)
• Contractible non-edges in \(3\)-connected graphs (Q1569036) (← links)
• Non-contractible non-edges in 2-connected graphs (Q1675819) (← links)
• A splitter theorem on 3-connected matroids (Q1686245) (← links)
• Contractible subgraphs in 3-connected graphs (Q1850482) (← links)
• Coloring the faces of convex polyhedra so that like colors are far apart (Q1850618) (← links)
• Non-contractible edges in a 3-connected graph (Q1900184) (← links)
• A remark on the connectivity of the complement of a 3-connected graph (Q1916372) (← links)
• The circumference of a graph with no \(K_{3,t}\)-minor. II (Q1931398) (← links)
• Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \) (Q2032743) (← links)
• Contractible edges and contractible triangles in a 3-connected graph (Q2051887) (← links)
• Excluding a ladder (Q2095109) (← links)
• Contractible edges in 3-connected graphs that preserve a minor (Q2284723) (← links)
• Contractible edges and removable edges in 3-connected graphs (Q2287731) (← links)
• Contractible and removable edges in 3-connected infinite graphs (Q2354601) (← links)
• Reduction for 3-connected graphs of minimum degree at least four (Q2373428) (← links)
• An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326) (← links)
• On the number of contractible triples in 3-connected graphs (Q2464158) (← links)
• An extremal problem on contractible edges in 3-connected graphs (Q2502038) (← links)
• Properly 3-contractible edges in a minimally 3-connected graph (Q2689494) (← links)
• On the Structure of Contractible Vertex Pairs in Chordal Graphs (Q2839231) (← links)
• A general upper bound for the cyclic chromatic number of 3‐connected plane graphs (Q3652538) (← links)
• Minimal locally cyclic triangulations of the projective plane (Q4277985) (← links)
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge (Q4277986) (← links)
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (Q4908826) (← links)
• Contractible Edges in 3-Connected Cubic Graphs (Q5087094) (← links)
• (Q5139700) (← links)
• Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph (Q5899379) (← links)