Shengxiang Lv

Available identifiers

Publication	Date of Publication	Type
The crossing number of nearly complete bipartite graphs	2024-10-25	Paper
Constructing nonorientable genus embedding of complete bipartite graph minus a matching	2023-05-17	Paper
The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane	2022-01-03	Paper
https://portal.mardi4nfdi.de/entity/Q5209255	2020-01-22	Paper
Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)	2019-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4643069	2018-05-25	Paper
The smallest surface that contains all signed graphs on \(K_{4, n}\)	2018-01-19	Paper
Up-embeddability of graphs with new degree-sum	2017-04-21	Paper
The largest demigenus over all signatures on \(K_{3,n}\)	2015-01-20	Paper
Genus polynomial for similar benzene structure graphs	2013-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q4649982	2012-11-15	Paper
A new bound on maximum genus of simple graphs.	2012-04-03	Paper
Up-embeddability of graphs with small order	2010-02-12	Paper
4-connected 1-planar chordal graphs are Hamiltonian-connected	N/A	Paper

This page was built for person: Shengxiang Lv