The number of contractible edges in 3-connected graphs
From MaRDI portal
Publication:1111571
DOI10.1007/BF01864172zbMATH Open0658.05047OpenAlexW2001082365MaRDI QIDQ1111571FDOQ1111571
Authors: Katsuhiro Ota 
Publication date: 1988
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01864172
Recommendations
Cites Work
Cited In (28)
- An extremal problem on contractible edges in 3-connected graphs
- Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
- Contractible circuits in \(3\)-connected graphs
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
- Title not available (Why is that?)
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- On the number of contractible triples in 3-connected graphs
- Contractible edges in longest cycles in non-Hamiltonian graphs
- Digraphs contractible onto $\sp *K\sb 3$
- Title not available (Why is that?)
- Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
- The 3‐connected graphs with a maximum matching containing precisely one contractible edge
- Title not available (Why is that?)
- Title not available (Why is that?)
- On edge contractible graphs.
- Contractible Edges in 3-Connected Cubic Graphs
- Contractible edges in subgraphs of \(2\)-connected graphs
- Contractible edges and removable edges in 3-connected graphs
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- A contractible graph with eleven vertices and no gluable edge
- Title not available (Why is that?)
- THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES
- Properly 3-contractible edges in a minimally 3-connected graph
- Contractible edges in triangle-free graphs
- Contractible edges in 3-connected graphs
- 3‐connected graphs with non‐cut contractible edge covers of size k
- Contractible edges and contractible triangles in a 3-connected graph
- Contractible edges in 3-connected graphs that preserve a minor
This page was built for publication: The number of contractible edges in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111571)
