On k-critical, n-connected graphs

DOI10.1016/0012-365X(77)90065-6MaRDI QIDQ1245975zbMATH OpenOpenAlexFDO

Authors Stephen B. Maurer, Peter Slater

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(77)90065-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3284075 (Why is no real title available?)
• On k-minimally n-edge-connected graphs
• Parallel concepts in graph theory
• Vertex colorings without isolates

Cited in

(19)

• On a conjecture of Entringer and Slater
• Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs)
• Indestructive deletions of edges from graphs
• On k-critical connected line graphs
• On the existence of (k,l)-critical graphs
• On critically connected digraphs
• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• There exist highly critically connected graphs of diameter three
• Proof of Mader's conjecture on k‐critical n‐connected graphs
• Generalizaions of critical connectivity of graphs
• On k-minimally n-edge-connected graphs
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Fragments in kcritical n‐connected graphs
• High connectivity keeping sets in graphs and digraphs
• On locally \(k\)-critically \(n\)-connected graphs
• Connectivity keeping edges in graphs with large minimum degree
• Vertex colorings without isolates
• On multiply critically h-connected graphs
• The symmetric (2k, k)-graphs

This page was built for publication: On k-critical, n-connected graphs

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