scientific article; zbMATH DE number 907923

MaRDI QIDQ4886767zbMATH OpenFDO

Authors Ming-Chun Tsai, Hung-Lin Fu

Publication date 15 October 1996

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

zbMATH Keywords

connected graphgenusupper embeddabilityupper embeddable graphs

Mathematics Subject Classification ID

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

Recommendations

• On upper bound graphs with edge operations
• Upper embeddability of graphs
• On upper bound graphs with respect to operations on graphs
• scientific article; zbMATH DE number 4012641
• Vertex splitting and upper embeddable graphs
• A note on the upper embeddability of graphs
• Upper embeddability of graphs and vertex degree in a cycle
• Upper embeddable graphs via the degree-sum of adjacent vertices.
• Upper embeddable graphs with respect to \(A\)-partition on vertices
• The vertice degree condition on upper embeddability of graphs

Cites work

• scientific article; zbMATH DE number 4177080 (Why is no real title available?)
• scientific article; zbMATH DE number 969182 (Why is no real title available?)
• A Characterization in of Upper-Embeddable Graphs
• A new characterization of the maximum genus of a graph
• A note on upper embeddable graphs
• Bounds of the number of disjoint spanning trees
• How to determine the maximum genus of a graph
• On 2-cell embeddings of graphs with minimum numbers of regions
• The maximum genus of graphs of diameter two

Cited in

(12)

• Vertex splitting and upper embeddable graphs
• Some new classes of upper embeddable graphs.
• scientific article; zbMATH DE number 4156462 (Why is no real title available?)
• scientific article; zbMATH DE number 3900781 (Why is no real title available?)
• Upper-embeddability of a graph \(G^3\)
• The maximum genus of vertex-transitive graphs
• scientific article; zbMATH DE number 3845605 (Why is no real title available?)
• scientific article; zbMATH DE number 4101216 (Why is no real title available?)
• Domination number and upper embeddability of a simple graph
• $N_2$-locally connected graphs and their upper embeddability
• On locally quasiconnected graphs and their upper embeddability
• Locally connectivity and up-embeddability 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 Q4886767)