On r-connected graphs with no semi-topological r-wheel

Keyphrases

• Connected Graph 100%
• Number of Edges 50%
• Combinatorial Optimization 50%
• Combinatorics 50%
• Polyhedron 50%
• Internal Vertices 50%
• Edge Cut 50%
• Minimum Edge Cut 50%
• 3-connected 50%
• Contractible Edge 50%
• Recognisable Sets 50%
• Cactus Representation 50%

Mathematics

• Edge 100%
• Connected Graph 100%
• Free Graph 50%
• Upper Bound 25%
• Combinatorics 25%
• Polyhedron 25%
• Equal Degree 25%

Computer Science

• Connected Graph 100%
• Subgraphs 50%
• Combinatorial Optimisation 50%
• Adjacent Vertex 50%
• Subclasses 50%