Sulla tracciabilita' di grafi finiti su superficie compatte
From MaRDI portal
Publication:3890713
DOI10.1007/BF02925564zbMath0446.05018OpenAlexW2077296088MaRDI QIDQ3890713
Publication date: 1978
Published in: Rendiconti del Seminario Matematico e Fisico di Milano (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02925564
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sistemi di circuiti tracciati su una superficie omeomorfa al toro e loro modelli algebrici
- The genus of nearly complete graphs-case 6
- Das Geschlecht des vollständigen paaren Graphen
- Alcuni sviluppi sulla teoria relativa dei singrammi finiti
- The genus of the Cartesian product of two graphs
- On the genus of the composition of two graphs
- On the maximum genus of a graph
- A Kuratowski-type theorem for the maximum genus of a graph
- Smooth solutions in case 1 of the Heawood conjecture for non-orientable surfaces
- Zwei Bemerkungen über Komplexe
- The map-coloring of unorientable surfaces
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
- A Theorem on Planar Graphs
- Map Colour Theorems Related To the Heawood Colour Formula
- From the theory of regular graphs of third and fourth degree
- On the Four-Colour Conjecture
- The Maximum Genus of Cartesian Products of Graphs
- Planar Graphs
- The Genus of the n-Cube
- PLANAR GRAPHS AND RELATED TOPICS
- The Genus, Regional Number, and Betti Number of a Graph
- Additivity of the genus of a graph
- A criterion for planarity of the square of a graph
- The genus of K12s
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Remarks on the Heawood conjecture (nonorientable case)
- The nonorientable genus of 𝐾_{𝑛}
- Solution of the Heawood map-coloring problem—case 11
- The genus of the complete tripartite graph Kmn,n,n
- Solution of the heawood map-coloring problem—Case 4
- The heawood map-coloring problem—Cases 1, 7, and 10
- Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9
- The Genus of Repeated Cartesian Products of Bipartite Graphs
- Orientable embedding of Cayley graphs
- A Note on the Heawood Color Formula
- The Mapping of Graphs on Surfaces
- On the Imbedding of Linear Graphs in Surfaces
- Map-Colour Theorems
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings