scientific article

zbMath0583.05045MaRDI QIDQ3708051

Ladislav Nebeský

Publication date: 1984

Full work available at URL: https://eudml.org/doc/13468

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

factorizationmaximum genus of a graphupper embeddable graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: