Up-embeddability of graphs with small order

DOI10.1016/J.AML.2009.10.001MaRDI QIDQ847307zbMATH OpenOpenAlexFDO

Authors Shengxiang Lv, Yanpei Liu

Publication date 12 February 2010

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2009.10.001

zbMATH Keywords

Moore boundmaximum genusup-embeddability

Mathematics Subject Classification ID

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

Recommendations

• Up-embeddability of a graph by order and girth
• Up-embeddability via girth and the degree-sum of adjacent vertices
• Up-embeddability of graphs with new degree-sum
• Up-embeddability and independent number of simple graphs.
• Up-embeddability of graphs with new degree-sum of independent vertices

Cites work

• scientific article; zbMATH DE number 951476 (Why is no real title available?)
• A Characterization in of Upper-Embeddable Graphs
• A new characterization of the maximum genus of a graph
• Graph theory
• On the maximum genus of a graph

Cited in

(4)

• Up-embeddability of a graph by order and girth
• Embedding digraphs of small size
• Up-embeddability and independent number of simple graphs.
• Up-embeddability of graphs with new degree-sum

This page was built for publication: Up-embeddability of graphs with small order

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