An upper bound for the minimum degree of a graph

DOI10.21136/cmj.1977.101482zbMath0384.05049OpenAlexW2786155726MaRDI QIDQ4163260

Ladislav Nebeský

Publication date: 1977

Full work available at URL: https://eudml.org/doc/13016

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on n-connected graphs
• Critically n-Connected Graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: An upper bound for the minimum degree of a graph