scientific article; zbMATH DE number 495474

zbMath0788.05033MaRDI QIDQ4277394

Ladislav Nebeský

Publication date: 7 February 1994

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

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

zbMATH Keywords

maximum genusconnected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

A note on disjoint cycles ⋮ The maximum genus, matchings and the cycle space of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of the maximum genus of a signed graph
• Duke's theorem does not extend to signed graph embeddings
• How to determine the maximum genus of a graph
• Perfect matchings of a graph
• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• The combinatorial map color theorem
• On Representatives of Subsets
• The Genus, Regional Number, and Betti Number of a Graph
• The Factorization of Linear Graphs
• A THEOREM ON INDEPENDENCE RELATIONS

This page was built for publication: