An extremal problem in graph theory

DOI10.1007/BF02760258MaRDI QIDQ2532795zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(12)

• The number of cut vertices and cut arcs in a strong directed graph
• The numbers of cut-vertices and end-blocks in 4-regular graphs
• The extreme set condition of a graph
• An Extremal Graph Problem with a Transcendental Solution
• The number of cut-vertices in a graph of given minimum degree
• Extremum problems with separable graphs
• The number of blocks of a graph with given minimum degree
• Graph theory
• scientific article; zbMATH DE number 1958588 (Why is no real title available?)
• The number of cutvertices in graphs with given minimum degree
• Two extremal problems in graph theory
• On the power sequence of a graph

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

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