Upper embeddability, edge independence number and girth

DOI10.1007/S11425-009-0002-1MaRDI QIDQ1044280zbMATH OpenOpenAlexFDO

Authors Ling Tang, Zhangdong Ouyang, Yuanqiu Huang

Publication date 11 December 2009

Published in Science in China. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-009-0002-1

zbMATH Keywords

upper embeddability

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Upper embeddability, girth and the degree-sum of nonadjacent vertices
• A sufficient condition on upper embeddability of graphs
• Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
• Up-embeddability and independent number of simple graphs.
• The degree-sum of adjacent vertices, girth and upper embeddability

Cites work

• A Characterization in of Upper-Embeddable Graphs
• A new characterization of the maximum genus of a graph
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs
• Graph theory with applications
• How to determine the maximum genus of a graph
• Maximum genus and chromatic number of graphs
• Maximum genus, girth and maximum non-adjacent edge set.
• On the average crosscap number. II: Bounds for a graph
• On the maximum genus of a graph
• Up-embeddability of a graph by order and girth
• Upper-embeddable graphs and related topics

Cited in

(4)

• Up-embeddability via girth and the degree-sum of adjacent vertices
• A sufficient condition on upper embeddability of graphs
• Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\)
• Up-embeddability and independent number of simple graphs.

This page was built for publication: Upper embeddability, edge independence number and girth

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