A sufficient condition on upper embeddability of graphs

DOI10.1007/S11425-009-0169-5zbMATH Open1223.05035OpenAlexW1983947192MaRDI QIDQ989758FDOQ989758

Authors: Guanghua Dong, Junliang Cai, Yanpei Liu 

Publication date: 23 August 2010

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-009-0169-5

Recommendations

• Upper embeddability, girth and the degree-sum of nonadjacent vertices
• Upper embeddability, edge independence number and girth
• scientific article; zbMATH DE number 5630901
• The vertice degree condition on upper embeddability of graphs
• Up-embeddability of a graph by order and girth

zbMATH Keywords

connected graphgirthmaximum genusupper embeddable

Mathematics Subject Classification ID

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

Cites Work

• Bounds of the number of disjoint spanning trees
• How to determine the maximum genus of a graph
• The maximum genus of graphs of diameter two
• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• Title not available (Why is that?)
• Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
• Maximum genus and chromatic number of graphs
• A class of upper-embeddable graphs
• Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices

Cited In (16)

• Vertex splitting and upper embeddable graphs
• Title not available (Why is that?)
• A note on the upper embeddability of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Up-embeddability of a graph by order and girth
• Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
• Upper embeddability, girth and the degree-sum of nonadjacent vertices
• Upper embeddability, edge independence number and girth
• Upper embeddable graphs with respect to diameter
• The vertice degree condition on upper embeddability of graphs
• Title not available (Why is that?)
• Upper embeddability of graphs and vertex degree in a cycle
• Up-embeddability of graphs with new degree-sum of independent vertices
• The degree-sum of adjacent vertices, girth and upper embeddability
• Locally connectivity and up-embeddability of a graph

This page was built for publication: A sufficient condition on upper embeddability of graphs

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