An upper bound for the minimum degree of a graph

DOI10.21136/CMJ.1977.101482MaRDI QIDQ4163260zbMATH OpenOpenAlexFDO

Authors 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) Connectivity (05C40) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3308124 (Why is no real title available?)
• scientific article; zbMATH DE number 3312524 (Why is no real title available?)
• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• 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

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