Binlong Li

Xia Liu

Shipeng Wang

Discret. Math., January, 2024

2023

Eigenvalues and cycles of consecutive lengths.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

The Turán number of directed paths and oriented cycles.

[BibT_eX]

[DOI]

Wenling Zhou

Graphs Comb., June, 2023

Anti-Ramsey numbers for vertex-disjoint triangles.

[BibT_eX]

[DOI]

Discret. Math., 2023

Connected k-factors in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2023

Stability of Woodall's Theorem and Spectral Conditions for Large Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles.

[BibT_eX]

[DOI]

Jie Ma

J. Comb. Theory B, 2022

More aspects of arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Julien Bensmail

Discuss. Math. Graph Theory, 2022

Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Exact bipartite Turán numbers of large even cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

An Injective Version of the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Julien Bensmail

Bi Li

Graphs Comb., 2021

Almost eulerian compatible spanning circuits in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

On minimizing the maximum color for the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Sub-Ramsey Numbers for Matchings.

[BibT_eX]

[DOI]

Fangfang Wu

Graphs Comb., 2020

Bipartite Independent Number and Hamilton-Biconnectedness of Bipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Thomassen's conjecture for line graphs of 3-hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Compatible spanning circuits in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

A classification of edge-colored graphs based on properly colored walks.

[BibT_eX]

[DOI]

Ruonan Li

Discret. Appl. Math., 2020

Kernels by rainbow paths in arc-colored tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Lumos: A Library for Diagnosing Metric Regressions in Web-Scale Applications.

[BibT_eX]

[DOI]

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2019

Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Large degree vertices in longest cycles of graphs, II.

[BibT_eX]

[DOI]

Liming Xiong

Jun Yin

Electron. J. Graph Theory Appl., 2019

2018

Extremal problems on the Hamiltonicity of claw-free graphs.

[BibT_eX]

[DOI]

Xing Peng

Discret. Math., 2018

Conditions for graphs to be path partition optimal.

[BibT_eX]

[DOI]

Discret. Math., 2018

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity.

[BibT_eX]

[DOI]

Petr Vrána

J. Graph Theory, 2017

An Exact Formula for all Star-Kipas Ramsey Numbers.

[BibT_eX]

[DOI]

Yanbo Zhang

Graphs Comb., 2017

Cycles through all finite vertex sets in infinite graphs.

[BibT_eX]

[DOI]

André Kündgen

Carsten Thomassen

Eur. J. Comb., 2017

Heavy subgraphs, stability and Hamiltonicity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Forbidden pairs of disconnected graphs for traceability in connected graphs.

[BibT_eX]

[DOI]

Junfeng Du

Liming Xiong

Discret. Math., 2017

Disjoint Cycles of Different Lengths in Graphs and Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions.

[BibT_eX]

[DOI]

Graphs Comb., 2016

On Star-Wheel Ramsey Numbers.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Graphs Comb., 2016

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition.

[BibT_eX]

[DOI]

Graphs Comb., 2016

On the Ramsey-Goodness of Paths.

[BibT_eX]

[DOI]

Halina Bielak

Graphs Comb., 2016

Heavy subgraph conditions for longest cycles to be heavy in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Large degree vertices in longest cycles of graphs, I.

[BibT_eX]

[DOI]

Liming Xiong

Jun Yin

Discuss. Math. Graph Theory, 2016

Forbidden subgraphs for hamiltonicity of 1-tough graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Universal arcs in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2016

Distance powers of unitary Cayley graphs.

[BibT_eX]

[DOI]

Xiaogang Liu

Appl. Math. Comput., 2016

2015

Characterizing Heavy Subgraph Pairs for Pancyclicity.

[BibT_eX]

[DOI]

Graphs Comb., 2015

A note on the number of spanning trees of line digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Forbidden subgraphs for longest cycles to contain vertices with large degrees.

[BibT_eX]

[DOI]

Discret. Math., 2015

Vertex-disjoint cycles in bipartite tournaments.

[BibT_eX]

[DOI]

Hao Li

Discret. Math., 2015

Closing the Gap on Path-Kipas Ramsey Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Rainbow triangles in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Heavy subgraph pairs for traceability of block-chains.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

The Ramsey Numbers of Paths Versus Wheels: a Complete Solution.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Forbidden subgraph pairs for traceability of block-chains.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2013

2012

Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Pairs of forbidden induced subgraphs for homogeneously traceable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts.

[BibT_eX]

[DOI]

Discret. Math., 2012

Notes on heavy cycles in weighted digraphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

Cross-view activity recognition using Hankelets.

[BibT_eX]

[DOI]

Octavia I. Camps

Mario Sznaier

Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

2011

Heavy cycles and spanning trees with few leaves in weighted graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Dynamic subspace-based coordinated multicamera tracking.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Computer Vision, 2011

Activity recognition using dynamic subspace angles.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011

2010

On extremal weighted digraphs with no heavy paths.

[BibT_eX]

[DOI]