Sur un Theoreme Min-Max En Theorie Des Graphes (D'Après L. Nebeský)

DOI10.1016/S0304-0208(08)73431-5zbMATH Open0519.05027OpenAlexW132380066MaRDI QIDQ3669438FDOQ3669438

Authors:

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73431-5

zbMATH Keywords

Betti numbercomponents2-cell imbeddingsclosed orientable 2- manifolds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (1)

• Maximum genus and connectivity

This page was built for publication: Sur un Theoreme Min-Max En Theorie Des Graphes (D'Après L. Nebeský)

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