The maximum genus, matchings and the cycle space of a graph

DOI10.1023/A:1022845722159zbMath0949.05015OpenAlexW1591056615MaRDI QIDQ4515306

Martin Škoviera, Ming-Chun Tsai, Hung-Lin Fu

Publication date: 13 November 2000

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

matchingcycle spacemaximum genus

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)

Related Items

Unnamed Item, Unnamed Item, Fundamental cycles and graph embeddings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of the maximum genus of a signed graph
• Kuratowski-type theorems for average genus
• How to determine the maximum genus of a graph
• The relative maximum genus of a graph
• On the maximum genus of a graph
• A Kuratowski-type theorem for the maximum genus of a graph
• Local extrema in genus-stratified graphs
• On 2-cell embeddings of graphs with minimum numbers of regions
• A new characterization of the maximum genus of a graph
• Orientation embedding of signed graphs
• Graphs with 1-Factors
• A Characterization in of Upper-Embeddable Graphs
• On Representatives of Subsets
• The Factorization of Linear Graphs
• The maximal genus of planar graphs