Maximum genus, connectivity and minimal degree of graphs
From MaRDI portal
Publication:2570108
DOI10.1016/j.disc.2005.01.003zbMath1075.05025OpenAlexW2108060744MaRDI QIDQ2570108
Publication date: 26 October 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.01.003
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to determine the maximum genus of a graph
- The maximum genus of graphs with diameter three
- Maximum genus and girth of graphs
- Maximum genus and maximum nonseparating independent set of a 3-regular graph
- Maximum genus and connectivity
- A tight lower bound on the maximum genus of a simplicial graph
- The maximum genus of graphs of diameter two
- A new characterization of the maximum genus of a graph
This page was built for publication: Maximum genus, connectivity and minimal degree of graphs