33 citations · 69 across the 48 of their papers we have counts for
5 papers · 1 filter
Nonempty intersection of longest paths in -free graphs
Gili Golan, Songling Shan
In 1966, Gallai asked whether all longest paths in a connected graph share a common vertex. Counterexamples indicate that this is not true in general. However, Gallai's question is…
Spanning trails with maximum degree at most 4 in -free graphs
Guantao Chen, M. N. Ellingham, Akira Saito +1
A graph is called -free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every -tough -free graph wi…
Chromatic index determined by fractional chromatic index
Guantao Chen, Yuping Gao, Ringi Kim +2
Given a graph possibly with multiple edges but no loops, denote by the {\it maximum degree}, the {\it multiplicity}, the {\it chromatic index} and the {\it…
Regular colorings and factors of regular graphs
Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4
An -coloring of an -regular graph is an edge coloring such that each vertex is incident to edges of one color and edge of a different color. In this paper…
A Note On Vertex Distinguishing Edge colorings of Trees
Songling Shan, Bing Yao
A proper edge coloring of a simple graph is called a vertex distinguishing edge coloring (vdec) if for any two distinct vertices and of , the set of the colors assig…