Maximum genus of regular graphs
From MaRDI portal
Recommendations
Cites work
- A Characterization in of Upper-Embeddable Graphs
- A new characterization of the maximum genus of a graph
- Characterization of the maximum genus of a signed graph
- Graphs on surfaces
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 4177080 (Why is no real title available?)
- Maximum genus and girth of graphs
- On the lower bounds for the maximum genus for simple graphs
- The Genus, Regional Number, and Betti Number of a Graph
- The graph genus problem is NP-complete
- Upper-embeddable graphs and related topics
Cited in
(10)- Maximum genus and girth of graphs
- Maximum genus and chromatic number of graphs
- Maximum genus of a graph in terms of its embedding properties.
- Results of the maximum genus of graphs
- A new effective algorithm for the maximum genus of two types of 3-regular graphs
- scientific article; zbMATH DE number 5630189 (Why is no real title available?)
- scientific article; zbMATH DE number 5657419 (Why is no real title available?)
- scientific article; zbMATH DE number 3931037 (Why is no real title available?)
- Lower bounds for the maximum genus of 4-regular graphs
- Genus ranges of 4-regular rigid vertex graphs
This page was built for publication: Maximum genus of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857401)