A note on upper embeddable graphs
From MaRDI portal
Publication:3666871
DOI10.21136/CMJ.1983.101853zbMATH Open0518.05029OpenAlexW2294391594MaRDI QIDQ3666871FDOQ3666871
Authors: Ladislav Nebeský 
Publication date: 1983
Full work available at URL: https://eudml.org/doc/13359
Cites Work
- Title not available (Why is that?)
- How to determine the maximum genus of a graph
- A Characterization in of Upper-Embeddable Graphs
- On the maximum genus of a graph
- A new characterization of the maximum genus of a graph
- Survey of results on the maximum genus of a graph
- Upper embeddability and connectivity of graphs
Cited In (6)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- The maximum genus of vertex-transitive graphs
- Bidirectional retracting-free double tracings and upper embeddability of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Face size and the maximum genus of a graph. I: Simple graphs
This page was built for publication: A note on upper embeddable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666871)
