Up-embeddability of graphs with small order

DOI10.1016/J.AML.2009.10.001zbMATH Open1227.05134OpenAlexW2017331178MaRDI QIDQ847307FDOQ847307

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

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

zbMATH Keywords

Moore boundmaximum genusup-embeddability

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• A Characterization in of Upper-Embeddable Graphs
• Title not available (Why is that?)
• On the maximum genus of a graph
• A new characterization of 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)