Songling Shan

activity

20132026

most citedNonempty Intersection of Longest Paths in Series-Parallel Graphs

33 citations · 69 across the 48 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

math.CO2017★ 1 cited

Vizing's 2-factor Conjecture Involving Toughness and Maximum Degree Conditions

Jinko Kanno, Songling Shan

Let $G$ be a simple graph, and let $Δ (G)$ and $χ^{'} (G)$ denote the maximum degree and chromatic index of $G$ , respectively. Vizing proved that $χ^{'} (G) = Δ (G)$ or $Δ (G) + 1$ . We say $G$ is…

math.CO2017★ 4 cited

Hamiltonian cycles in 3-tough $2 K_{2}$ -free graphs

Songling Shan

A graph is called $2 K_{2}$ -free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25-tough $2 K_{2}$ -free graph with at…

math.CO2017★ 4 cited

Antimagic orientation of biregular bipartite graphs

Songling Shan, Xiaowei Yu

An antimagic labeling of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to the integers ${1, \dots, m}$ such that all $n$ oriente…

math.CO2017

Toughness and spanning trees in $K_{4}$ -minor-free graphs

M. N. Ellingham, Songling Shan, Dong Ye +1

For an integer $k$ , a $k$ -tree is a tree with maximum degree at most $k$ . More generally, if $f$ is an integer-valued function on vertices, an $f$ -tree is a tree in which each vert…

Vizing's 2-factor Conjecture Involving Toughness and Maximum Degree Conditions

Hamiltonian cycles in 3-tough 2K2​-free graphs

Antimagic orientation of biregular bipartite graphs

Toughness and spanning trees in K4​-minor-free graphs

Hamiltonian cycles in 3-tough $2 K_{2}$ -free graphs

Toughness and spanning trees in $K_{4}$ -minor-free graphs