2 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2017★ 2 cited
Locating any two vertices on Hamiltonian cycles
Weihua He, Hao Li, Qiang Sun
In this paper we give a proof of Enomoto's conjecture for graphs of sufficiently large order. Enomoto's conjecture states that, if is a graph of order with minimum degree $…
math.CO2015
Walk-powers and homomorphism bound of planar graphs
Reza Naserasr, Sagnik Sen, Qiang Sun
As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, .…