Alexandr V. Kostochka

,

,

J. Graph Theory, April, 2026

A lower bound on the number of edges in DP-critical graphs.

[BibT_eX]

[DOI]

Peter Bradshaw

,

Ilkyoo Choi

,

,

J. Comb. Theory B, 2026

Equitable list coloring of sparse graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2026

Trees with at Least 6ℓ +11 Vertices are ℓ-Reconstructible.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., December, 2025

Sparse Critical Graphs for Defective (1, 3)-Coloring.

[BibT_eX]

[DOI]

,

,

Graphs Comb., October, 2025

Equitable List Coloring of Planar Graphs With Given Maximum Degree.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, April, 2025

Acyclic graphs with at least 2ℓ + 1 vertices are ℓ-recognizable.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2025

A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs, II: Large Uniformities.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2025

Turán Number for Bushes.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2025

Minimal abundant packings and choosability with separation.

[BibT_eX]

[DOI]

,

,

Des. Codes Cryptogr., December, 2024

A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs.

[BibT_eX]

[DOI]

,

,

Comb., August, 2024

Sharp lower bounds for the number of maximum matchings in bipartite multigraphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2024

Dirac-type theorems for long Berge cycles in hypergraphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2024

Sparse critical graphs for defective DP-colorings.

[BibT_eX]

[DOI]

,

Discret. Math., 2024

Equitable coloring of planar graphs with maximum degree at least eight.

[BibT_eX]

[DOI]

,

Duo Lin

,

Discret. Math., 2024

On a property of 2-connected graphs and Dirac's Theorem.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2024

Extremal Problems for Hypergraph Blowups of Trees.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., December, 2023

Minimum degree ensuring that a hypergraph is hamiltonian-connected.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., December, 2023

Generalized DP-colorings of graphs.

[BibT_eX]

[DOI]

,

Thomas Schweser

,

Discret. Math., November, 2023

Saturation for the 3-uniform loose 3-cycle.

[BibT_eX]

[DOI]

Sean English

,

,

Discret. Math., November, 2023

A sharp lower bound for the spectral radius in K4-saturated graphs.

[BibT_eX]

[DOI]

,

,

Suil O

,

Yongtang Shi

,

Zhiwen Wang

Discret. Math., 2023

Longest cycles in 3-connected hypergraphs and bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2022

Monochromatic connected matchings in 2-edge-colored multipartite graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2022

Defective DP-colorings of sparse simple graphs.

[BibT_eX]

[DOI]

Yifan Jing

,

,

Fuhong Ma

,

Discret. Math., 2022

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.

[BibT_eX]

[DOI]

,

,

,

Comb. Probab. Comput., 2022

Towards the Small Quasi-Kernel Conjecture.

[BibT_eX]

[DOI]

,

,

Songling Shan

Electron. J. Comb., 2022

On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2021

Partitioning ordered hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory A, 2021

Cut-Edges and Regular Factors in Regular Graphs of Odd Degree.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2021

On 2-defective DP-colorings of sparse graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2021

Injective edge-coloring of graphs with given maximum degree.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2021

3-regular graphs are 2-reconstructible.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2021

Defective DP-colorings of sparse multigraphs.

[BibT_eX]

[DOI]

Yifan Jing

,

,

Fuhong Ma

,

Pongpat Sittitrai

,

Eur. J. Comb., 2021

Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2021

Conditions for a Bigraph to be Super-Cyclic.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2021

Fractional DP-colorings of sparse graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2020

Super-pancyclic hypergraphs and bipartite graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2020

The Minimum Number of Edges in 4-Critical Digraphs of Given Order.

[BibT_eX]

[DOI]

,

Graphs Comb., 2020

Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2020

The minimum spectral radius of Kr+1-saturated graphs.

[BibT_eX]

[DOI]

,

,

,

Suil O

Discret. Math., 2020

Ordered and Convex Geometric Trees with Linear Extremal Function.

[BibT_eX]

[DOI]

,

,

,

Discret. Comput. Geom., 2020

On r-uniform hypergraphs with circumference less than r.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2020

On-line DP-coloring of graphs.

[BibT_eX]

[DOI]

,

,

Xuer Li

,

Discret. Appl. Math., 2020

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2020

Berge Cycles in Non-Uniform Hypergraphs.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2020

Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2019

Avoiding long Berge cycles.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.

[BibT_eX]

[DOI]

Ilkyoo Choi

,

Ringi Kim

,

,

Boram Park

,

Graphs Comb., 2019

Extremal Union-Closed Set Families.

[BibT_eX]

[DOI]

Guantao Chen

,

Hein van der Holst

,

,

Nana Li

Graphs Comb., 2019

Packing Chromatic Number of Subdivisions of Cubic Graphs.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2019

DP-colorings of hypergraphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2019

A variation of a theorem by Pósa.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2019

On 2-Connected Hypergraphs with No Long Cycles.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2019

Cubic Graphs with Small Independence Ratio.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2019

Extensions of a theorem of Erdős on nonhamiltonian graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2018

Sharp Dirac's theorem for DP-critical graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2018

Strong edge-colorings of sparse graphs with large maximum degree.

[BibT_eX]

[DOI]

Ilkyoo Choi

,

,

,

Eur. J. Comb., 2018

List star edge-coloring of subcubic graphs.

[BibT_eX]

[DOI]

Samia Kerdjoudj

,

,

Discuss. Math. Graph Theory, 2018

Stability in the Erdős-Gallai Theorem on cycles and paths, II.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2018

Packing chromatic number of cubic graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2018

A Sharp Dirac-Erdős Type Bound for Large Graphs.

[BibT_eX]

[DOI]

,

,

Comb. Probab. Comput., 2018

A Brooks-Type Result for Sparse Critical Graphs.

[BibT_eX]

[DOI]

,

Comb., 2018

Strengthening Theorems of Dirac and Erdős on Disjoint Cycles.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2017

Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2017

Turán problems and shadows II: Trees.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2017

On the Corrádi-Hajnal theorem and a question of Dirac.

[BibT_eX]

[DOI]

,

,

Elyse Yeager

J. Comb. Theory B, 2017

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.

[BibT_eX]

[DOI]

Min Chen

,

,

,

,

J. Comb. Theory B, 2017

DP-colorings of graphs with high chromatic number.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2017

A stability version for a theorem of Erdős on nonhamiltonian graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2017

Cycles in triangle-free graphs of large chromatic number.

[BibT_eX]

[DOI]

,

Benny Sudakov

,

Comb., 2017

The (2k-1)-connected multigraphs with at most k-1 disjoint cycles.

[BibT_eX]

[DOI]

,

,

Elyse Yeager

Comb., 2017

Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2016

Stability in the Erdős-Gallai Theorems on cycles and paths.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2016

Strong chromatic index of subcubic planar multigraphs.

[BibT_eX]

[DOI]

Watcharintorn Ruksasakchai

,

Xiaodong Li

,

,

Michael Santana

,

Tao Wang

,

G. Yu

Eur. J. Comb., 2016

On a packing problem of Alon and Yuster.

[BibT_eX]

[DOI]

,

,

Derrek Yager

Discret. Math., 2016

A list version of graph packing.

[BibT_eX]

[DOI]

Ervin Györi

,

,

,

Derrek Yager

Discret. Math., 2016

On the number of edges in a graph with no (k+1)-connected subgraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

Adding Edges to Increase the Chromatic Number of a Graph.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2016

Turán Problems and Shadows III: Expansions of Graphs.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2015

Turán problems and shadows I: Paths and cycles.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 2015

The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges.

[BibT_eX]

[DOI]

,

Benjamin Reiniger

Eur. J. Comb., 2015

A refinement of a result of Corrádi and Hajnal.

[BibT_eX]

[DOI]

,

Comb., 2015

On independent sets in hypergraphs.

[BibT_eX]

[DOI]

,

,

Random Struct. Algorithms, 2014

Ks, t Minors in (s+t)- Chromatic Graphs, II.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Choosability with Separation of Complete Multipartite Graphs and Hypergraphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2014

Ore's conjecture on color-critical graphs is almost true.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2014

Defective 2-colorings of sparse graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2014

Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2014

Short proofs of coloring theorems on planar graphs.

[BibT_eX]

[DOI]

,

,

Bernard Lidický

,

Eur. J. Comb., 2014

Planar 4-critical graphs with four triangles.

[BibT_eX]

[DOI]

,

Zdenek Dvorák

,

,

Bernard Lidický

,

Eur. J. Comb., 2014

Maximum hypergraphs without regular subgraphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2014

A new tool for proving Vizing's Theorem.

[BibT_eX]

[DOI]

Discret. Math., 2014

Describing faces in plane triangulations.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

Ore's conjecture for k=4 and Grötzsch's Theorem.

[BibT_eX]

[DOI]

,

Comb., 2014

A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge.

[BibT_eX]

[DOI]

,

Christopher J. Stocker

,

J. Graph Theory, 2013

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.

[BibT_eX]

[DOI]

,

,

,

Hehui Wu

,

J. Graph Theory, 2013

Equitable List Coloring of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2013

Hypergraph Ramsey numbers: Triangles versus cliques.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 2013

Coloring some finite sets in Rn .

[BibT_eX]

[DOI]

,

,

Andrei M. Raigorodskii

Discuss. Math. Graph Theory, 2013

On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

On 11-improper 22-coloring of sparse graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2013

Describing 3-paths in normal plane maps.

[BibT_eX]

[DOI]

,

,

Tommy R. Jensen

,

,

Discret. Math., 2013

On Perfect Packings in Dense Graphs.

[BibT_eX]

[DOI]

,

,

Andrew Treglown

Electron. J. Comb., 2013

Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2012

Graphs Containing Every 2-Factor.

[BibT_eX]

[DOI]

,

Graphs Comb., 2012

Packing and Covering Triangles in K 4-free Planar Graphs.

[BibT_eX]

[DOI]

Penny E. Haxell

,

,

Stéphan Thomassé

Graphs Comb., 2012

A stability theorem on fractional covering of triangles by edges.

[BibT_eX]

[DOI]

Penny E. Haxell

,

,

Stéphan Thomassé

Eur. J. Comb., 2012

Graphs with chromatic number close to maximum degree.

[BibT_eX]

[DOI]

,

Landon Rabern

,

Discret. Math., 2012

On Ks, t-minors in graphs with given average degree, II.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Dense uniform hypergraphs have high list chromatic number.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Harmonious coloring of trees with large maximum degree.

[BibT_eX]

[DOI]

Saieed Akbari

,

,

Discret. Math., 2012

Large Rainbow Matchings in Edge-Coloured Graphs.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2012

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges.

[BibT_eX]

[DOI]

,

,

Tomasz Luczak

Comb. Probab. Comput., 2012

Hypergraph list coloring and Euclidean Ramsey theory.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2011

Ohba's conjecture for graphs with independence number five.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2011

Large minors in graphs with given independence number.

[BibT_eX]

[DOI]

,

Discret. Math., 2011

Minors in Graphs with High Chromatic Number.

[BibT_eX]

[DOI]

,

,

Andrew Thomason

Comb. Probab. Comput., 2011

Graphs with maximum degree 5 are acyclically 7-colorable.

[BibT_eX]

[DOI]

,

Christopher J. Stocker

Ars Math. Contemp., 2011

Constructions of sparse uniform hypergraphs with high chromatic number.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2010

On Ks, t minors in (s+t)-chromatic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Some constructive bounds on Ramsey numbers.

[BibT_eX]

[DOI]

,

Pavel Pudlák

,

J. Comb. Theory B, 2010

Graphs with bounded tree-width and large odd-girth are almost bipartite.

[BibT_eX]

[DOI]

,

Daniel Král'

,

Jean-Sébastien Sereni

,

J. Comb. Theory B, 2010

Dense graphs have K3, t minors.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

Hadwiger numbers and over-dominating colourings.

[BibT_eX]

[DOI]

,

,

Andrew Thomason

Discret. Math., 2010

A fast algorithm for equitable coloring.

[BibT_eX]

[DOI]

,

,

Marcelo Mydlarz

,

Endre Szemerédi

Comb., 2010

Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.

[BibT_eX]

[DOI]

,

Comb., 2010

Coloring uniform hypergraphs with few edges.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2009

Induced subgraphs with distinct sizes.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2009

M-degrees of quadrangle-free planar graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2009

Ore-type versions of Brooks' theorem.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2009

Decompositions of quadrangle-free planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2009

Ore-type conditions implying 2-factors consisting of short cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

An upper bound on the domination number of n-vertex connected cubic graphs.

[BibT_eX]

[DOI]

,

B. Y. Stodolsky

Discret. Math., 2009

A Brooks-type bound for squares of K4-minor-free graphs.

[BibT_eX]

[DOI]

,

Lale Özkahya

,

Discret. Math., 2009

Planar graphs decomposable into a forest and a matching.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2009

Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

The Erdos-Lovász Tihany conjecture for quasi-line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2009

Efficient Graph Packing via Game Colouring.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2009

Sizes of Induced Subgraphs of Ramsey Graphs.

[BibT_eX]

[DOI]

,

,

,

Wojciech Samotij

Comb. Probab. Comput., 2009

Adapted List Coloring of Graphs and Hypergraphs.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2008

Ore-type degree conditions for a graph to be H-linked.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2008

On k-detour subgraphs of hypercubes.

[BibT_eX]

[DOI]

Nana Arizumi

,

,

J. Graph Theory, 2008

Packing of graphs with small product of sizes.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2008

An Ore-type theorem on equitable coloring.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2008

Packing d-degenerate graphs.

[BibT_eX]

[DOI]

Béla Bollobás

,

,

J. Comb. Theory B, 2008

Hadwiger Number and the Cartesian Product of Graphs.

[BibT_eX]

[DOI]

L. Sunil Chandran

,

,

J. Krishnam Raju

Graphs Comb., 2008

On 2-Detour Subgraphs of the Hypercube.

[BibT_eX]

[DOI]

,

Graphs Comb., 2008

Decomposing a planar graph with girth 9 into a forest and a matching.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2008

On Ks, t-minors in graphs with given average degree.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

When is an Almost Monochromatic K4 Guaranteed?

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2008

A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2008

Partitions and Edge Colourings of Multigraphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2008

On a graph packing conjecture by Bollobás, Eldridge and Catlin.

[BibT_eX]

[DOI]

Hemanshu Kaul

,

,

Comb., 2008

An Ore-type analogue of the Sauer-Spencer Theorem.

[BibT_eX]

[DOI]

,

Graphs Comb., 2007

Tree representations of graphs.

[BibT_eX]

[DOI]

Nancy Eaton

,

,

,

Jozef Skokan

Eur. J. Comb., 2007

Ore-type graph packing problems.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2007

Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer.

[BibT_eX]

[DOI]

Hemanshu Kaul

,

Comb. Probab. Comput., 2007

On Directed Triangles in Digraphs.

[BibT_eX]

[DOI]

,

Penny E. Haxell

,

Electron. J. Comb., 2007

On Minimum Degree Implying That a Graph is H-Linked.

[BibT_eX]

[DOI]

Ronald J. Gould

,

,

SIAM J. Discret. Math., 2006

On Ramsey numbers of uniform hypergraphs with given maximum degree.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2006

Dominating sets in k-majority tournaments.

[BibT_eX]

[DOI]

,

Graham R. Brightwell

,

,

,

Peter Winkler

J. Comb. Theory B, 2006

Chvátal's Condition cannot hold for both a graph and its complement.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2006

On Sufficient Degree Conditions for a Graph to be k-linked.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

,

,

Comb. Probab. Comput., 2006

On equitable Delta-coloring of graphs with low average degree.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2005

On Equitable Coloring of d-Degenerate Graphs.

[BibT_eX]

[DOI]

,

,

Sriram V. Pemmaraju

SIAM J. Discret. Math., 2005

An extremal problem for H-linked graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2005

Nordhaus-Gaddum-type Theorems for decompositions into many parts.

[BibT_eX]

[DOI]

,

,

Riste Skrekovski

,

,

J. Graph Theory, 2005

Even cycles in hypergraphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2005

Minimum degree conditions for H-linked graphs.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2005

Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2005

Disjoint Kr-minors in large graphs with given average degree.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2005

On domination in connected cubic graphs.

[BibT_eX]

[DOI]

,

B. Y. Stodolsky

Discret. Math., 2005

Smaller planar triangle-free graphs that are not 3-list-colorable.

[BibT_eX]

[DOI]

Alexei N. Glebov

,

,

Vladimir A. Tashkinov

Discret. Math., 2005

Precoloring Extensions of Brooks' Theorem.

[BibT_eX]

[DOI]

Michael O. Albertson

,

,

SIAM J. Discret. Math., 2004

Coloring uniform hypergraphs with few colors.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Homomorphisms from sparse graphs with large girth.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2004

Balanced edge colorings.

[BibT_eX]

[DOI]

Paul N. Balister

,

,

Hao Li

,

Richard H. Schelp

J. Comb. Theory B, 2004

On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2004

On Graphs With Small Ramsey Numbers, II.

[BibT_eX]

[DOI]

,

Comb., 2004

Decomposing Graphs into Long Paths.

[BibT_eX]

[DOI]

,

Vladimir A. Tashkinov

Order, 2003

A list analogue of equitable coloring.

[BibT_eX]

[DOI]

,

Michael J. Pelsmajer

,

J. Graph Theory, 2003

Degree conditions for k-ordered hamiltonian graphs.

[BibT_eX]

[DOI]

Ralph J. Faudree

,

Ronald J. Gould

,

,

Linda M. Lesniak

,

Ingo Schiermeyer

,

Akira Saito

J. Graph Theory, 2003

A new lower bound on the number of edges in colour-critical graphs and hypergraphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2003

On Ramsey Numbers of Sparse Graphs.

[BibT_eX]

[DOI]

,

Benny Sudakov

Comb. Probab. Comput., 2003

Equitable Colourings Of D-Degenerate Graphs.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2003

Total choosability of multicircuits II.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

Total choosability of multicircuits I.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

A list version of Dirac's theorem on the number of edges in colour-critical graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

Acyclic list 7-coloring of planar graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2002

Nilpotent Families of Endomorphisms of (p(V)+, cup).

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2002

Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2002

Equitable colorings of outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

Transversals in Uniform Hypergraphs with Property (p, 2).

[BibT_eX]

[DOI]

Comb., 2002

On the chromatic number of set systems.

[BibT_eX]

[DOI]

,

,

,

Prasad Tetali

Random Struct. Algorithms, 2001

On graphs with small Ramsey numbers.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2001

On Deeply Critical Oriented Graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2001

Sparse sets in the complements of graphs with given girth.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

Choosability conjectures and multicircuits.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

Colorings and homomorphisms of degenerate and bounded degree graphs.

[BibT_eX]

[DOI]

,

,

Petra Smolíková

Discret. Math., 2001

On nice graphs.

[BibT_eX]

[DOI]

Pavol Hell

,

,

,

Discret. Math., 2001

Acyclic colouring of 1-planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2001

Density Conditions for Panchromatic Colourings of Hypergraphs.

[BibT_eX]

[DOI]

,

Comb., 2001

Local and Mean Ramsey Numbers for Trees.

[BibT_eX]

[DOI]

Béla Bollobás

,

,

Richard H. Schelp

J. Comb. Theory B, 2000

Vertex Set Partitions Preserving Conservativeness.

[BibT_eX]

[DOI]

Alexander A. Ageev

,

J. Comb. Theory B, 2000

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2000

Colouring triangle-free intersection graphs of boxes on the plane.

[BibT_eX]

[DOI]

,

Irina G. Perepelitsa

Discret. Math., 2000

On the Hajo's number of graphs.

[BibT_eX]

[DOI]

Gregory Z. Gutin

,

,

Bjarne Toft

Discret. Math., 2000

On degrees of vertices in paradoxical trees.

[BibT_eX]

[DOI]

Walter A. Deuber

,

Discret. Math., 2000

Variable degeneracy: extensions of Brooks' and Gallai's theorems.

[BibT_eX]

[DOI]

,

,

Bjarne Toft

Discret. Math., 2000

On the Number of Edges in Colour-Critical Graphs and Hypergraphs.

[BibT_eX]

[DOI]

,

Comb., 2000

Hypercube subgraphs with local detours.

[BibT_eX]

[DOI]

,

,

Alexander F. Sidorenko

J. Graph Theory, 1999

Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 1999

Transversals in uniform hypergraphs with property (7, 2).

[BibT_eX]

[DOI]

,

,

Discret. Math., 1999

On the maximum average degree and the oriented chromatic number of a graph.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 1999

Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 1999

Partial Steiner systems and matchings in hypergraphs.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 1998

Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1998

Total Colourings of Planar Graphs with Large Girth.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 1998

Colour-critical graphs with few edges.

[BibT_eX]

[DOI]

,

Discret. Math., 1998

On the independent domination number of graphs with given minimum degree.

[BibT_eX]

[DOI]

N. I. Glebov

,

Discret. Math., 1998

On kernel-perfect orientations of line graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1998

On universal graphs for planar oriented graphs of a given girth.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 1998

On Large Systems of Sets with No Large Weak <Delta>-subsystems.

[BibT_eX]

[DOI]

,

Comb., 1998

Total interval number for graphs with bounded degree.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1997

Acyclic and oriented chromatic numbers of graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 1997

Total colorings of planar graphs with large maximum degree.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 1997

Intersection Statements for Systems of Sets.

[BibT_eX]

[DOI]

Walter A. Deuber

,

Paul Erdös

,

David S. Gunderson

,

,

A. G. Meyer

J. Comb. Theory A, 1997

List Edge and List Total Colourings of Multigraphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 1997

Covering and coloring polygon-circle graphs.

[BibT_eX]

[DOI]

,

Jan Kratochvíl

Discret. Math., 1997

Graphs without short odd cycles are nearly bipartite.

[BibT_eX]

[DOI]

Ervin Györi

,

,

Tomasz Luczak

Discret. Math., 1997

Spanning trees with pairwise nonadjacent endvertices.

[BibT_eX]

[DOI]

,

Hajo Broersma

,

F. Göbel

,

,

Discret. Math., 1997

An intersection theorem for systems of sets.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

The colour theorems of Brooks and Gallai extended.

[BibT_eX]

[DOI]

,

,

Brunhilde Wirth

Discret. Math., 1996

The total chromatic number of any multigraph with maximum degree five is at most seven.

[BibT_eX]

[DOI]

Discret. Math., 1996

The Number of Spanning Trees in Graphs with Given Degree Sequence.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

The 7/5-conjecture strengthens itself.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

On set systems without weak 3-Delta-subsystems.

[BibT_eX]

[DOI]

Maria Axenovich

,

,

Discret. Math., 1995

Radius and Diameter of Random Subgraphs of the Hypercube.

[BibT_eX]

[DOI]

,

Alexander A. Sapozhenko

,

K. Weber

Random Struct. Algorithms, 1993

The independent domination number of a cubic 3-connected graph can be much larger than its domination number.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Covering boxes by points.

[BibT_eX]

[DOI]

,

Discret. Math., 1993

List edge chromatic number of graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 1992

Matchings in Random Spanning Subgraphs of Cubelike Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Samll topological complete subgraphs of "dense" graphs.

[BibT_eX]

[DOI]

,

László Pyber

Comb., 1988

Maximum set of edges no two covered by a clique.

[BibT_eX]

[DOI]

Comb., 1985

Lower bound of the Hadwiger number of graphs by their average degree.

[BibT_eX]

[DOI]

Comb., 1984

A class of constructions for Turán's (3, 4) problem.

[BibT_eX]

[DOI]

Comb., 1982

On an upper bound of a graph's chromatic number, depending on the graph's degree and density.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1977

The total coloring of a multigraph with maximal degree 4.

[BibT_eX]

[DOI]

Discret. Math., 1977

Note to the paper of Grünbaum on acyclic colorings.

[BibT_eX]

[DOI]