An extremal problem in graph theory

DOI10.1007/BF02760258zbMath0174.55201OpenAlexW2068266495MaRDI QIDQ2532795

A. Ramachandra Rao

Publication date: 1968

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

The number of blocks of a graph with given minimum degree ⋮ The number of cut vertices and cut arcs in a strong directed graph ⋮ The number of cutvertices in graphs with given minimum degree ⋮ The number of cut-vertices in a graph of given minimum degree ⋮ The numbers of cut-vertices and end-blocks in 4-regular graphs ⋮ Graph theory ⋮ On the power sequence of a graph

Cites Work

• Unnamed Item

This page was built for publication: An extremal problem in graph theory