scientific article

zbMath0643.05027MaRDI QIDQ3784090

Aldo G. S. Ventre, Tomaž Pisanski, Giustina Pica, T. D. Parsons

Publication date: 1987

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

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

zbMATH Keywords

graph embeddingembedding of a graphgenus of a graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Upper bounds for domination related parameters in graphs on surfaces ⋮ On the 1-chromatic number of nonorientable surfaces with large genus ⋮ On dynamic coloring for planar graphs and graphs of higher genus ⋮ The matching extendability of surfaces ⋮ The Genus of a Random Bipartite Graph ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ Power graphs of (non)orientable genus two ⋮ On the matching extendability of graphs in surfaces ⋮ The non-orientable genus of some metacyclic groups ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces ⋮ On the restricted matching extension of graphs in surfaces ⋮ The genus of complete 3-uniform hypergraphs ⋮ Restricted matching in graphs of small genus ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ Bounding the size of equimatchable graphs of fixed genus ⋮ A map colour theorem for the union of graphs ⋮ Local certification of graphs with bounded genus ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ Extending matchings in graphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blocks and the nonorientable genus of graphs
• The combinatorial map color theorem
• Generalized Embedding Schemes
• Non-existence of graph embeddings
• A Six Color Problem

This page was built for publication: