The maximum genus of a 3-regular simplicial graph
From MaRDI portal
Publication:1807872
DOI10.1007/s11766-999-0027-9zbMath0945.05017OpenAlexW2017719513MaRDI QIDQ1807872
Publication date: 8 October 2000
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-999-0027-9
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Induced forests in cubic graphs
- How to determine the maximum genus of a graph
- Upper-embeddable graphs and related topics
- Maximum genus and maximum nonseparating independent set of a 3-regular graph
- Bounds of the number of disjoint spanning trees
- Maximum genus and connectivity
- A tight lower bound on the maximum genus of a simplicial graph
- Lower Bounds For Induced Forests in Cubic Graphs
- On feedback vertex sets and nonseparating independent sets in cubic graphs
- A Characterization in of Upper-Embeddable Graphs
- Unnamed Item