Maximum genus, girth and maximum non-adjacent edge set.

zbMATH Open1141.05316MaRDI QIDQ3428641FDOQ3428641

Authors: Yichao Chen, Yanpei Liu 

Publication date: 29 March 2007

Recommendations

• scientific article; zbMATH DE number 5657419
• Maximum genus, degree of vertex and girth
• A new bound on maximum genus of simple graphs.
• Survey of maximum genus of graphs
• Maximum genus and girth of graphs

zbMATH Keywords

girthmatching numbermaximum genusupper embeddability

Mathematics Subject Classification ID

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

Cited In (6)

• Survey of maximum genus of graphs
• Title not available (Why is that?)
• Matchings, cycle bases, and the maximum genus of a graph
• Title not available (Why is that?)
• Upper embeddability, girth and the degree-sum of nonadjacent vertices
• Upper embeddability, edge independence number and girth

This page was built for publication: Maximum genus, girth and maximum non-adjacent edge set.

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