Guantao Chen

J. Comb. Optim., January, 2026

From Sketch to Fresco: Efficient Diffusion Transformer with Progressive Resolution.

[BibT_eX]

[DOI]

CoRR, January, 2026

Forecast the Principal, Stabilize the Residual: Subspace-Aware Feature Caching for Efficient Diffusion Transformers.

[BibT_eX]

[DOI]

CoRR, January, 2026

Strong binding numbers and factors.

[BibT_eX]

[DOI]

Mikhail Lavrov

Yuying Ma

Jennifer Vandenbussche

Hein van der Holst

Discret. Math., 2026

2025

Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., October, 2025

Let Features Decide Their Own Solvers: Hybrid Feature Caching for Diffusion Transformers.

[BibT_eX]

[DOI]

CoRR, October, 2025

Pseudo-Multifan and Lollipop.

[BibT_eX]

[DOI]

J. Graph Theory, 2025

The exact Turán number of disjoint graphs- A generalization of Simonovits' theorem, and beyond.

[BibT_eX]

[DOI]

Xingyu Lei

Shuchao Li

Eur. J. Comb., 2025

Edge Cover Through Edge Coloring.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Decreasing the mean subtree order by adding k edges.

[BibT_eX]

[DOI]

J. Graph Theory, March, 2024

A decomposition method on solving the linear arboricity conjecture.

[BibT_eX]

[DOI]

Guoning Yu

J. Graph Theory, February, 2024

Overfullness of edge-critical graphs with small minimal core degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

The core conjecture of Hilton and Zhao.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Precoloring extension of Vizing's Theorem for multigraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

A Chvátal-Erdős type theorem for path-connectivity.

[BibT_eX]

[DOI]

Zhiquan Hu

Yaping Wu

Discuss. Math. Graph Theory, 2024

2023

Linear arboricity of degenerate graphs.

[BibT_eX]

[DOI]

Guoning Yu

J. Graph Theory, October, 2023

On Gupta's Codensity Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Local Dirac's condition on the existence of 2-factor.

[BibT_eX]

[DOI]

Xiaodong Chen

Discret. Math., July, 2023

Double Vizing fans in critical class two graphs.

[BibT_eX]

[DOI]

Xuli Qi

J. Graph Theory, May, 2023

Spanning trees with at most k leaves in 2-connected K1,r-free graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., May, 2023

On the coequal values of total chromatic number and chromatic index.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Unions of perfect matchings in r-graphs.

[BibT_eX]

[DOI]

Nizamettin Tokar

Discret. Math., 2023

2022

The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Multithreshold multipartite graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Independence number of edge-chromatic critical graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

A note on Goldberg's conjecture on total chromatic numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Overfullness of critical class 2 graphs with a small core degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

An improvement to the Hilton-Zhao vertex-splitting conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Multiplicity of the second-largest eigenvalue of a planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Laminar tight cuts in matching covered graphs.

[BibT_eX]

[DOI]

Cláudio Leonardo Lucchesi

Xing Feng

Fuliang Lu

Lianzhu Zhang

J. Comb. Theory B, 2021

On the average degree of edge chromatic critical graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Improved bounds on the Ramsey number of fans.

[BibT_eX]

[DOI]

Xiaowei Yu

Yi Zhao

Eur. J. Comb., 2021

The conjunction of the linear arboricity conjecture and Lovász's path partition theorem.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Ring graphs and Goldberg's bound on chromatic index.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

On the average degree of edge chromatic critical graphs II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The Chromatic Number of Graphs with No Induced Subdivision of K4.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Spanning bipartite graphs with high degree sum in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Hamiltonicity of edge-chromatic critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

Dirac's Condition for Spanning Halin Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Disjoint Odd Cycles in Cubic Solid Bricks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Structural properties of edge-chromatic critical multigraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Extremal Union-Closed Set Families.

[BibT_eX]

[DOI]

Hein van der Holst

Alexandr V. Kostochka

Nana Li

Graphs Comb., 2019

Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Graph Edge Coloring: A Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Average degrees of edge-chromatic critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

Chromatic index determined by fractional chromatic index.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Cycles with a chord in dense graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Plane Triangulations Without a Spanning Halin Subgraph II.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Vizing's 2-Factor Conjecture Involving Large Maximum Degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Equitable vertex arboricity of 5-degenerate graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Nonempty intersection of longest paths in series-parallel graphs.

[BibT_eX]

[DOI]

Julia Ehrenmüller

Cristina G. Fernandes

Discret. Math., 2017

Hamiltonicity of edge chromatic critical graphs.

[BibT_eX]

[DOI]

Xiaodong Chen

Yue Zhao

Discret. Math., 2017

2016

Bayesian Inference for Functional Dynamics Exploring in fMRI Data.

[BibT_eX]

[DOI]

Comput. Math. Methods Medicine, 2016

2015

Disjoint Chorded Cycles of the Same Length.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Hadwiger's conjecture for degree sequences.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Characterizing Forbidden Pairs for Hamiltonian Squares.

[BibT_eX]

[DOI]

Graphs Comb., 2015

An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Dynamic Bayesian brain network partition and connectivity change point detection.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

2014

On Maximum Edge Cuts of Connected Digraphs.

[BibT_eX]

[DOI]

Manzhan Gu

Nana Li

J. Graph Theory, 2014

Degree Conditions for Spanning Brooms.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

2013

The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Homeomorphically irreducible spanning trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

2012

The circumference of a graph with no K3, t-minor, II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Hamiltonian cycles with all small even chords.

[BibT_eX]

[DOI]

Discret. Math., 2012

Endpoint extendable paths in dense graphs.

[BibT_eX]

[DOI]

Zhiquan Hu

Hao Li

Discret. Math., 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs.

[BibT_eX]

[DOI]

Han Ren

Comb. Probab. Comput., 2012

2011

Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Circumferences of k-connected graphs involving independence numbers.

[BibT_eX]

[DOI]

Zhiquan Hu

Yaping Wu

J. Graph Theory, 2011

Approximating the chromatic index of multigraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Toughness of Ka,t-Minor-Free Graphs.

[BibT_eX]

[DOI]

Yoshimi Egawa

Bojan Mohar

Electron. J. Comb., 2011

2010

Transitive partitions in realizations of tournament score sequences.

[BibT_eX]

[DOI]

Arthur H. Busch

J. Graph Theory, 2010

Optimization Model and Algorithm Help to Screen and Treat Sexually Transmitted Diseases.

[BibT_eX]

[DOI]

Int. J. Comput. Model. Algorithms Medicine, 2010

Path spectra for trees.

[BibT_eX]

[DOI]

Lubomír Soltés

Discret. Math., 2010

Efficient parallel algorithms for maximum-density segment problem.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009

Toric Geometry of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Joseph Brennan

SIAM J. Discret. Math., 2009

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2009

A universal framework for partial coverage in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 28th International Performance Computing and Communications Conference, 2009

2008

Non-path spectrum sets.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Linked graphs with restricted lengths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces.

[BibT_eX]

[DOI]

Beifang Chen

Graphs Comb., 2008

Graphic sequences with a realization containing a complete multipartite subgraph.

[BibT_eX]

[DOI]

Discret. Math., 2008

Saturation Numbers of Books.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Chvátal Erdós condition and 2-factors with a specyfied number of components.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Discuss. Math. Graph Theory, 2007

The neighborhood union of independent sets and hamiltonicity of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Decomposition of bipartite graphs into special subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Cycle Extendability of Hamiltonian Interval Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Approximating Longest Cycles in Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Hamiltonian graphs involving neighborhood unions.

[BibT_eX]

[DOI]

Bing Wei

J. Graph Theory, 2006

The circumference of a graph with no K3, t-minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Characterization of [1, k]-Bar Visibility Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Cysteine separations profiles on protein secondary structure infer disulfide connectivity.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

2005

Graph minors and linkages.

[BibT_eX]

[DOI]

Florian Pfender

Bing Wei

J. Graph Theory, 2005

Approximating the Longest Cycle Problem on Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

An Interlacing Result on Normalized Laplacians.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Circumference of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Jun Xu

SIAM J. Comput., 2004

Vertex-disjoint cycles containing specified vertices in a bipartite graph.

[BibT_eX]

[DOI]

Hikoe Enomoto

Dingjun Lou

J. Graph Theory, 2004

Cycles in 4-connected planar graphs.

[BibT_eX]

[DOI]

Genghua Fan

Eur. J. Comb., 2004

Linear forests and ordered cycles.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

New Conditions for k-ordered Hamiltonian Graphs.

[BibT_eX]

Florian Pfender

Ars Comb., 2004

2003

Extremal graphs for intersecting cliques.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

On Ranks of Matrices Associated with Trees.

[BibT_eX]

[DOI]

Graphs Comb., 2003

Graph Connectivity After Path Removal.

[BibT_eX]

[DOI]

Comb., 2003

2002

Fragile graphs with small independent cuts.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Long Cycles in 3-Connected Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

A note on fragile graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

The hamiltonicity of bipartite graphs involving neighborhood unions.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Partitioning Vertices of a Tournament into Independent Cycles.

[BibT_eX]

[DOI]

Hao Li

J. Comb. Theory B, 2001

Degree-Light-Free Graphs and Hamiltonian Cycles.

[BibT_eX]

[DOI]

Bing Wei

Xuerong Zhang

Graphs Comb., 2001

Degree Sequences with Repeated Values.

[BibT_eX]

Ars Comb., 2001

Weak Clique-Covering Cycles and Paths.

[BibT_eX]

Ars Comb., 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.

[BibT_eX]

[DOI]

Hikoe Enomoto

Dingjun Lou

Australas. J Comb., 2001

2000

Cycles in 2-Factors of Balanced Bipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2000

2-factors in claw-free graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2000

Clique covering the edges of a locally cobipartite graph.

[BibT_eX]

[DOI]

Edward R. Scheinerman

Chi Wang

Discret. Math., 2000

1999

On 2-factors containing 1-factors in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Tough enough chordal graphs are Hamiltonian.

[BibT_eX]

[DOI]

Networks, 1998

Star-factors of tournaments.

[BibT_eX]

[DOI]

Xiaoyun Lu

Douglas B. West

J. Graph Theory, 1998

Note on graphs without repeated cycle lengths.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Intersections of Longest Cycles in k-Connected Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Vertex colorings with a distance restriction.

[BibT_eX]

[DOI]

András Gyárfás

Discret. Math., 1998

Note on Whitney's Theorem for k-connected Graphs.

[BibT_eX]

Ars Comb., 1998

Mixed Ramsey numbers: total chromatic number versus stars.

[BibT_eX]

[DOI]

Nirmala Achuthan

Australas. J Comb., 1998

1997

Graphs with given odd sets.

[BibT_eX]

[DOI]

Lubomír Soltés

J. Graph Theory, 1997

Special monochromatic trees in two-colored complete graphs.

[BibT_eX]

[DOI]

Lubomír Soltés

J. Graph Theory, 1997

Degree conditions for 2-factors.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Degree Sum Conditions for Hamiltonicity on k-Partite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

A Class of Edge Critical 4-Chromatic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

A New Game Chromatic Number.

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

A special k-coloring for a connected k-chromatic graph.

[BibT_eX]

[DOI]

Discret. Math., 1997

A result on C4-star Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 1997

Hamiltonian Graphs with Large Neighborhood Unions.

[BibT_eX]

Yiping Liu

Ars Comb., 1997

1996

A partition approach to Vizing's conjecture.

[BibT_eX]

[DOI]

Wiktor Piotrowski

J. Graph Theory, 1996

Essential independent sets and Hamiltonian cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Proof of a Conjecture of Bollob's on Nested Cycles.

[BibT_eX]

[DOI]

Paul Erdös

William Staton

J. Comb. Theory B, 1996

1995

Hamiltonicity for K1, r-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

The irredundant ramsey number s(3, 7).

[BibT_eX]

[DOI]

Cecil C. Rousseau

J. Graph Theory, 1995

Hamiltonicity in balancedk-partite graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1995

Vertex disjoint cycles for star free graphs.

[BibT_eX]

[DOI]

Lisa R. Marcus

Australas. J Comb., 1995

1994

Hamiltonian graphs with neighborhood intersections.

[BibT_eX]

[DOI]

J. Graph Theory, 1994

Neighborhood unions and the cycle cover number of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1994

Graphs with a Cycle of Length Divisible by Three.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

1993

Asymptotic bounds for irredundant and mixed Ramsey numbers.

[BibT_eX]

[DOI]

Johannes H. Hattingh

Cecil C. Rousseau

J. Graph Theory, 1993

Graphs with Linearly Bounded Ramsey Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

Hamiltonian graphs involving neighborhood intersections.

[BibT_eX]

[DOI]

Discret. Math., 1993

A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness.

[BibT_eX]

[DOI]

P. Bedrossian

Discret. Math., 1993

Ramsey Problems With Bounded Degree Spread.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

1992

Hamiltonian graphs involving distances.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

1990

One sufficient condition for hamiltonian graphs.

[BibT_eX]

[DOI]