Title
Supereulerian Graphs with Few Independent Edges
Abstract
Lai and Yan conjectured that every bridgeless simple graph G with alpha' (G) <= 3 is either supereulerian or one of {K-2,K-t, S-n,S-m K-1,K-3(1,1, 1)}, where n, m are natural numbers and t an odd number. In this paper, we show that every bridgeless simple graph G with alpha'(G) <= 3 is either supereulerian or G, is one of {(K-2,K-t, H-t, J(t), U-t, L-t,L-t1, L-t(1), M-t,M-t1, N-t,N-t1, A(t) B-t, K-v4v6(t,0,0) : t is odd), (I-t: is even), (U-t,U-t1 : t + t(1) is odd), (K-1,3(t1,t2t3): t(1), t(2), t(3) are the same parity), (K-t1,K-t2,K-t3, K-v1v5(t1,t2,t3), K-v2v5(t1,t2,t3): two of t(1), t(2), t(3) are the same parity, another is different)}.
Year
Venue
Keywords
2018
ARS COMBINATORIA
Supereulerian graph,Independent edges
Field
DocType
Volume
Graph,Discrete mathematics,Combinatorics,Mathematics
Journal
136
ISSN
Citations 
PageRank 
0381-7032
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Fuyuan Chen100.68
Xinran Zhang23812.02