A characterization of radius-critical graphs

DOI10.1002/jgt.3190120409zbMath0713.05037OpenAlexW2049629345MaRDI QIDQ3197851

Siemion Fajtlowicz

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120409

zbMATH Keywords

ciliater-critical graphsradis

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (5)

Minimum degree, edge-connectivity and radius ⋮ A characterization of graphs where the independence number equals the radius ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ The number of edges in a bipartite graph of given radius

This page was built for publication: A characterization of radius-critical graphs