Graphs G for which both G and G are contraction critically k-connected

DOI10.1007/S003730200054zbMATH Open1009.05087OpenAlexW2050127193MaRDI QIDQ1865622FDOQ1865622

Authors: Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa 

Publication date: 27 March 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200054

Recommendations

• scientific article; zbMATH DE number 2186977
• Vertices of degree 5 in a contraction critically 5-connected graph
• Contractible Edges in a k-Connected Graph
• Vertices of degree 6 in a 6-contraction critical graph
• Trivially noncontractible edges in a contraction critically 5-connected graph

zbMATH Keywords

complement\(k\)-connected graphcontractible edgecontraction critically \(k\)-connected

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (5)

• A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
• A study on distance in graph complement
• A note on graph and its complement with specified properties: Radius, diameter, center, and periphery
• Title not available (Why is that?)
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)

This page was built for publication: Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865622)