Up-embeddability of a graph by order and girth
From MaRDI portal
Publication:2464047
Recommendations
Cites work
- A Characterization in of Upper-Embeddable Graphs
- A class of upper-embeddable graphs
- A Kuratowski-type theorem for the maximum genus of a graph
- A new characterization of the maximum genus of a graph
- Bounds of the number of disjoint spanning trees
- Every connected, locally connected graph is upper embeddable
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 3877215 (Why is no real title available?)
- scientific article; zbMATH DE number 1382467 (Why is no real title available?)
- scientific article; zbMATH DE number 1270473 (Why is no real title available?)
- scientific article; zbMATH DE number 951476 (Why is no real title available?)
- On locally quasiconnected graphs and their upper embeddability
- On the maximum genus of a graph
Cited in
(5)
This page was built for publication: Up-embeddability of a graph by order and girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464047)