scientific article; zbMATH DE number 495474

MaRDI QIDQ4277394zbMATH OpenFDO

Authors Ladislav Nebeský

Publication date 7 February 1994

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

zbMATH Keywords

connected graphmaximum genus

Mathematics Subject Classification ID

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

Recommendations

• The maximum genus, matchings and the cycle space of a graph
• scientific article; zbMATH DE number 1382467
• The maximum genus on a 3-vertex-connected graph
• Maximum genus, connectivity, and Nebeský's theorem
• Matching extension and the genus of a graph

Cites work

• A Characterization in of Upper-Embeddable Graphs
• A new characterization of the maximum genus of a graph
• A THEOREM ON INDEPENDENCE RELATIONS
• Characterization of the maximum genus of a signed graph
• Duke's theorem does not extend to signed graph embeddings
• Graph theory with applications
• How to determine the maximum genus of a graph
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• scientific article; zbMATH DE number 3422404 (Why is no real title available?)
• On Representatives of Subsets
• On the maximum genus of a graph
• Perfect matchings of a graph
• The combinatorial map color theorem
• The Factorization of Linear Graphs
• The Genus, Regional Number, and Betti Number of a Graph

Cited in

(6)

• Maximum genus of a graph in terms of its embedding properties.
• Results of the maximum genus of graphs
• Genus characterizes the complexity of certain graph problems: Some tight results
• A note on disjoint cycles
• The maximum genus, matchings and the cycle space of a graph
• Matchings, cycle bases, and the maximum genus of a graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277394)