The decay number and the maximum genus of diameter 2 graphs

DOI10.1016/S0012-365X(00)00130-8zbMath0963.05040OpenAlexW2055257953WikidataQ126803931 ScholiaQ126803931MaRDI QIDQ1841903

Yanyan Li

Publication date: 3 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00130-8

zbMATH Keywords

extremal graphsdiametergenusdecay number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Results of the maximum genus of graphs ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: The decay number and the maximum genus of diameter 2 graphs