| Publication | Date of Publication | Type |
|---|
Minimal abundant packings and choosability with separation
Designs, Codes and Cryptography | 2024-12-11 | Paper |
A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs
Combinatorica | 2024-09-19 | Paper |
On a property of 2-connected graphs and Dirac's theorem
Discrete Mathematics | 2024-08-19 | Paper |
Dirac-type theorems for long Berge cycles in hypergraphs
Journal of Combinatorial Theory. Series B | 2024-07-01 | Paper |
Sparse critical graphs for defective DP-colorings
Discrete Mathematics | 2024-03-27 | Paper |
Saturation for the 3-uniform loose 3-cycle
Discrete Mathematics | 2023-11-27 | Paper |
Generalized DP-colorings of graphs
Discrete Mathematics | 2023-11-27 | Paper |
Extremal Problems for Hypergraph Blowups of Trees
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs, II: Large uniformities
| 2023-10-19 | Paper |
Sparse critical graphs for defective $(1,3)$-coloring
| 2023-10-12 | Paper |
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
Journal of Graph Theory | 2023-10-05 | Paper |
Longest cycles in 3‐connected hypergraphs and bipartite graphs
Journal of Graph Theory | 2023-10-05 | Paper |
Minimum degree ensuring that a hypergraph is Hamiltonian-connected
European Journal of Combinatorics | 2023-10-02 | Paper |
Equitable list coloring of planar graphs with given maximum degree
| 2023-09-02 | Paper |
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable
| 2023-08-08 | Paper |
Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible
| 2023-07-19 | Paper |
Tur\' an number for bushes
| 2023-07-10 | Paper |
Equitable coloring of planar graphs with maximum degree at least eight
| 2023-05-19 | Paper |
\(3\)-reconstructibility of rooted trees
Pure and Applied Mathematics Quarterly | 2023-04-05 | Paper |
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
On a property of $2$-connected graphs and Dirac's Theorem
| 2022-12-13 | Paper |
A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
Discrete Mathematics | 2022-11-23 | Paper |
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
| 2022-11-18 | Paper |
Towards the small quasi-kernel conjecture
The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
A characterization of Seymour graphs
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Canadian Journal of Mathematics | 2022-01-12 | Paper |
Defective DP-colorings of sparse simple graphs
Discrete Mathematics | 2021-10-27 | Paper |
Disjoint chorded cycles in graphs with high Ore-degree
| 2021-10-04 | Paper |
On sizes of 1-cross intersecting set pair systems
Siberian Mathematical Journal | 2021-09-27 | Paper |
Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs
| 2021-09-26 | Paper |
Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Avoiding long Berge cycles. II: Exact bounds for all \(n\)
Journal of Combinatorics | 2021-07-23 | Paper |
Injective edge-coloring of graphs with given maximum degree
European Journal of Combinatorics | 2021-06-18 | Paper |
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable
| 2021-03-22 | Paper |
Cut-edges and regular factors in regular graphs of odd degree
Graphs and Combinatorics | 2021-03-17 | Paper |
On 2-defective DP-colorings of sparse graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Defective DP-colorings of sparse multigraphs
European Journal of Combinatorics | 2021-02-08 | Paper |
3-regular graphs are 2-reconstructible
European Journal of Combinatorics | 2021-02-08 | Paper |
Conditions for a bigraph to be super-cyclic
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Tight paths in convex geometric hypergraphs
Advances in Combinatorics | 2020-10-20 | Paper |
Partitioning ordered hypergraphs
Journal of Combinatorial Theory. Series A | 2020-10-07 | Paper |
Super-pancyclic hypergraphs and bipartite graphs
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
Discrete Mathematics | 2020-09-10 | Paper |
Ordered and convex geometric trees with linear extremal function
Discrete \& Computational Geometry | 2020-09-01 | Paper |
On-line DP-coloring of graphs
Discrete Applied Mathematics | 2020-08-31 | Paper |
Berge cycles in non-uniform hypergraphs
The Electronic Journal of Combinatorics | 2020-07-30 | Paper |
$K_{r+1}$-saturated graphs with small spectral radius
| 2020-06-08 | Paper |
Fractional DP-colorings of sparse graphs
Journal of Graph Theory | 2020-05-21 | Paper |
The minimum number of edges in 4-critical digraphs of given order
Graphs and Combinatorics | 2020-04-30 | Paper |
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
Graphs and Combinatorics | 2020-04-30 | Paper |
On \(r\)-uniform hypergraphs with circumference less than \(r\)
Discrete Applied Mathematics | 2020-04-01 | Paper |
Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
Discrete Applied Mathematics | 2020-04-01 | Paper |
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
Moscow Journal of Combinatorics and Number Theory | 2020-02-21 | Paper |
Extremal union-closed set families
Graphs and Combinatorics | 2020-01-21 | Paper |
On 2-connected hypergraphs with no long cycles
The Electronic Journal of Combinatorics | 2019-11-15 | Paper |
Hypergraphs not containing a tight tree with a bounded trunk
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles
| 2019-07-25 | Paper |
Avoiding long Berge cycles
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Largest 2-regular subgraphs in 3-regular graphs
Graphs and Combinatorics | 2019-06-28 | Paper |
A variation of a theorem by Pósa
Discrete Mathematics | 2019-06-18 | Paper |
DP-colorings of hypergraphs
European Journal of Combinatorics | 2019-06-18 | Paper |
Monochromatic paths and cycles in $2$-edge-colored graphs with large minimum degree
| 2019-06-06 | Paper |
Packing chromatic number of subdivisions of cubic graphs
Graphs and Combinatorics | 2019-05-03 | Paper |
Cubic graphs with small independence ratio
The Electronic Journal of Combinatorics | 2019-03-22 | Paper |
Many cliques in \(H\)-free subgraphs of random graphs
Journal of Combinatorics | 2018-12-10 | Paper |
Extensions of a theorem of Erdős on nonhamiltonian graphs
Journal of Graph Theory | 2018-10-31 | Paper |
A Brooks-type result for sparse critical graphs
Combinatorica | 2018-09-24 | Paper |
Sharp Dirac's theorem for DP-critical graphs
Journal of Graph Theory | 2018-08-16 | Paper |
List star edge-coloring of subcubic graphs
Discussiones Mathematicae Graph Theory | 2018-08-10 | Paper |
Extremal problems on ordered and convex geometric hypergraphs
| 2018-07-13 | Paper |
A sharp Dirac-Erdős type bound for large graphs
Combinatorics, Probability and Computing | 2018-04-23 | Paper |
Cycles in triangle-free graphs of large chromatic number
Combinatorica | 2018-04-12 | Paper |
Stability in the Erdős-Gallai theorem on cycles and paths. II
Discrete Mathematics | 2018-04-05 | Paper |
Sharpening an ore-type version of the Corrádi-Hajnal theorem
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 2018-01-05 | Paper |
Packing chromatic number of cubic graphs
Discrete Mathematics | 2017-12-20 | Paper |
Strong edge-colorings of sparse graphs with large maximum degree
European Journal of Combinatorics | 2017-10-10 | Paper |
Adding edges to increase the chromatic number of a graph
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
A stability version for a theorem of Erdős on nonhamiltonian graphs
Discrete Mathematics | 2017-09-05 | Paper |
Tight paths in convex geometric hypergraphs
| 2017-09-04 | Paper |
DP-colorings of graphs with high chromatic number
European Journal of Combinatorics | 2017-08-31 | Paper |
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
Journal of Graph Theory | 2017-08-10 | Paper |
Tight descriptions of 3-paths in normal plane maps
Journal of Graph Theory | 2017-06-30 | Paper |
On DP-coloring of graphs and multigraphs
Siberian Mathematical Journal | 2017-06-30 | Paper |
On differences between DP-coloring and list coloring
| 2017-05-13 | Paper |
A refinement of a result of Corrádi and Hajnal
Combinatorica | 2017-03-31 | Paper |
The structure of large intersecting families
Proceedings of the American Mathematical Society | 2017-03-27 | Paper |
Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
On the Corrádi-Hajnal theorem and a question of Dirac
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Turán problems and shadows. II: Trees
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Stability in the Erdős-Gallai theorems on cycles and paths
Journal of Combinatorial Theory. Series B | 2016-10-12 | Paper |
Coloring, sparseness and girth
Israel Journal of Mathematics | 2016-09-15 | Paper |
On a packing problem of Alon and Yuster
Discrete Mathematics | 2016-07-05 | Paper |
Toward Żak's conjecture on graph packing
Journal of Combinatorics | 2016-05-25 | Paper |
A list version of graph packing
Discrete Mathematics | 2016-05-18 | Paper |
Ralph Faudree (1938--2015)
Discrete Mathematics | 2016-04-27 | Paper |
Improper coloring of sparse graphs with a given girth. II: Constructions
Journal of Graph Theory | 2016-04-15 | Paper |
On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
Discrete Mathematics | 2015-12-08 | Paper |
In memory of Dmitriĭ Germanovich Fon-Der-Flaass
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Hypergraph Ramsey numbers: triangles versus cliques
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Turán Problems and Shadows III: Expansions of Graphs
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
European Journal of Combinatorics | 2015-02-18 | Paper |
Turán problems and shadows. I: Paths and cycles
Journal of Combinatorial Theory. Series A | 2014-11-19 | Paper |
Ore's conjecture on color-critical graphs is almost true
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
European Journal of Combinatorics | 2014-09-04 | Paper |
Planar 4-critical graphs with four triangles
European Journal of Combinatorics | 2014-09-02 | Paper |
Ore's conjecture for \(k=4\) and Grötzsch's theorem
Combinatorica | 2014-08-14 | Paper |
Circular \((5,2)\)-coloring of sparse graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2014-06-13 | Paper |
A new bound on the domination number of connected cubic graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2014-06-13 | Paper |
Choosability with separation of complete multipartite graphs and hypergraphs
Journal of Graph Theory | 2014-05-28 | Paper |
\(K_{s,t}\) minors in \((s+t)\)-chromatic graphs. II
Journal of Graph Theory | 2014-05-22 | Paper |
Decomposition of Cartesian products of regular graphs into isomorphic trees
Journal of Combinatorics | 2014-05-13 | Paper |
A new tool for proving Vizing's theorem
Discrete Mathematics | 2014-05-06 | Paper |
On independent sets in hypergraphs
Random Structures \& Algorithms | 2014-04-15 | Paper |
Maximum hypergraphs without regular subgraphs
Discussiones Mathematicae Graph Theory | 2014-04-02 | Paper |
Short proofs of coloring theorems on planar graphs
European Journal of Combinatorics | 2014-03-25 | Paper |
Defective 2-colorings of sparse graphs
Journal of Combinatorial Theory. Series B | 2014-02-06 | Paper |
Describing faces in plane triangulations
Discrete Mathematics | 2014-01-27 | Paper |
Describing 3-paths in normal plane maps
Discrete Mathematics | 2014-01-24 | Paper |
On 1-improper 2-coloring of sparse graphs
Discrete Mathematics | 2014-01-24 | Paper |
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
Discrete Mathematics | 2014-01-16 | Paper |
Coloring some finite sets in \(\mathbb R^n\)
Discussiones Mathematicae. Graph Theory | 2013-12-13 | Paper |
Decomposition of sparse graphs into forests and a graph with bounded degree
Journal of Graph Theory | 2013-11-15 | Paper |
Equitable list coloring of graphs with bounded degree
Journal of Graph Theory | 2013-11-15 | Paper |
A hypergraph version of a graph packing theorem by Bollobás and Eldridge
Journal of Graph Theory | 2013-10-21 | Paper |
Coloring clean and \(K_4\)-free circle graphs
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
On coloring of sparse graphs
Lecture Notes in Computer Science | 2013-06-14 | Paper |
On perfect packings in dense graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs
Discrete Mathematics | 2013-03-01 | Paper |
Graphs containing every 2-factor
Graphs and Combinatorics | 2012-12-27 | Paper |
Packing and covering triangles in \(K_{4}\)-free planar graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
On \(K_{s,t}\)-minors in graphs with given average degree. II
Discrete Mathematics | 2012-11-20 | Paper |
Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
Journal of Graph Theory | 2012-09-12 | Paper |
Conflict-free colourings of uniform hypergraphs with few edges
Combinatorics, Probability and Computing | 2012-09-04 | Paper |
Dense uniform hypergraphs have high list chromatic number
Discrete Mathematics | 2012-07-04 | Paper |
Richard Schelp (1936-2010)
Discrete Mathematics | 2012-07-04 | Paper |
Harmonious coloring of trees with large maximum degree
Discrete Mathematics | 2012-05-30 | Paper |
Large rainbow matchings in edge-coloured graphs
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
A stability theorem on fractional covering of triangles by edges
European Journal of Combinatorics | 2012-05-04 | Paper |
Large rainbow matchings in large graphs
| 2012-04-14 | Paper |
Graphs with chromatic number close to maximum degree
Discrete Mathematics | 2012-04-13 | Paper |
Graphs with maximum degreee 5 are acyclically 7-colorable
Ars Mathematica Contemporanea | 2012-03-07 | Paper |
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
Siberian Mathematical Journal | 2012-03-07 | Paper |
Oriented 5-coloring of sparse plane graphs
Journal of Applied and Industrial Mathematics | 2012-02-10 | Paper |
Hypergraph list coloring and Euclidean Ramsey theory
Random Structures \& Algorithms | 2011-10-25 | Paper |
Large minors in graphs with given independence number
Discrete Mathematics | 2011-10-21 | Paper |
Minors in Graphs with High Chromatic Number
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
Combinatorica | 2011-07-22 | Paper |
Ohba's conjecture for graphs with independence number five
Discrete Mathematics | 2011-05-16 | Paper |
A fast algorithm for equitable coloring
Combinatorica | 2011-04-26 | Paper |
On \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs
Journal of Graph Theory | 2010-12-14 | Paper |
scientific article; zbMATH DE number 5825874 (Why is no real title available?)
| 2010-12-13 | Paper |
Constructions of sparse uniform hypergraphs with high chromatic number
Random Structures \& Algorithms | 2010-11-10 | Paper |
Coloring uniform hypergraphs with few edges
Random Structures \& Algorithms | 2010-11-09 | Paper |
Graphs with bounded tree-width and large odd-girth are almost bipartite
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
Dense graphs have \(K_{3,t}\) minors
Discrete Mathematics | 2010-10-18 | Paper |
Hadwiger numbers and over-dominating colourings
Discrete Mathematics | 2010-10-18 | Paper |
On a graph packing conjecture by Bollobás, Eldridge and Catlin
Combinatorica | 2010-08-13 | Paper |
Some constructive bounds on Ramsey numbers
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Efficient graph packing via game colouring
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Sizes of induced subgraphs of Ramsey graphs
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Extremal graph packing problems: Ore-type versus Dirac-type
| 2010-01-13 | Paper |
Ore-type conditions implying 2-factors consisting of short cycles
Discrete Mathematics | 2009-12-15 | Paper |
A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs
Discrete Mathematics | 2009-12-15 | Paper |
The Erdős-Lovász tihany conjecture for quasi-line graphs
Discrete Mathematics | 2009-12-09 | Paper |
A list version of Dirac's theorem on the number of edges in colour-critical graphs
Journal of Graph Theory | 2009-12-08 | Paper |
Decompositions of quadrangle-free planar graphs
Discussiones Mathematicae Graph Theory | 2009-08-03 | Paper |
On 2-detour subgraphs of the hypercube
Graphs and Combinatorics | 2009-04-29 | Paper |
Hadwiger number and the Cartesian product of graphs
Graphs and Combinatorics | 2009-04-29 | Paper |
An upper bound on the domination number of \(n\)-vertex connected cubic graphs
Discrete Mathematics | 2009-04-09 | Paper |
Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
Discrete Mathematics | 2009-04-09 | Paper |
Partitions and edge colourings of multigraphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On directed triangles in digraphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Adapted List Coloring of Graphs and Hypergraphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Ore-type versions of Brooks' theorem
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
Induced subgraphs with distinct sizes
Random Structures \& Algorithms | 2009-03-04 | Paper |
When is an Almost MonochromaticK4Guaranteed?
Combinatorics, Probability and Computing | 2009-03-04 | Paper |
M-degrees of quadrangle-free planar graphs
Journal of Graph Theory | 2009-02-20 | Paper |
Planar graphs decomposable into a forest and a matching
Discrete Mathematics | 2009-01-28 | Paper |
Packing of graphs with small product of sizes
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
Onk-detour subgraphs of hypercubes
Journal of Graph Theory | 2008-11-19 | Paper |
Minimax degrees of quasiplanar graphs with no short cycles other than triangles
Taiwanese Journal of Mathematics | 2008-09-29 | Paper |
Minimum degree conditions for \(H\)-linked graphs
Discrete Applied Mathematics | 2008-09-29 | Paper |
On \(K_{s,t}\)-minors in graphs with given average degree
Discrete Mathematics | 2008-09-04 | Paper |
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
Combinatorics, Probability and Computing | 2008-07-21 | Paper |
Decomposing a planar graph with girth 9 into a forest and a matching
European Journal of Combinatorics | 2008-05-29 | Paper |
Ore‐type degree conditions for a graph to be H‐linked
Journal of Graph Theory | 2008-05-14 | Paper |
Minimax degrees of quasiplane graphs without 4-faces
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-04-14 | Paper |
An Ore-type theorem on equitable coloring
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
Packing \(d\)-degenerate graphs
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
On Minimum Degree Implying That a Graph is H‐Linked
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
An Ore-type analogue of the Sauer-Spencer theorem
Graphs and Combinatorics | 2007-10-11 | Paper |
Minimum degree conditions for H-linked graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
Combinatorics, Probability and Computing | 2007-05-15 | Paper |
Tree representations of graphs
European Journal of Combinatorics | 2007-04-10 | Paper |
Ore-type graph packing problems
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
On the induced Ramsey number \(IR(P_3,H)\)
| 2007-03-05 | Paper |
On Ramsey numbers of uniform hypergraphs with given maximum degree
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
On Sufficient Degree Conditions for a Graph to be $k$-linked
Combinatorics, Probability and Computing | 2006-12-05 | Paper |
Chvátal's Condition cannot hold for both a graph and its complement
Discussiones Mathematicae Graph Theory | 2006-10-16 | Paper |
Color-critical graphs and hypergraphs with few edges: a survey
| 2006-06-29 | Paper |
Dominating sets in \(k\)-majority tournaments.
Journal of Combinatorial Theory. Series B | 2006-05-18 | Paper |
On equitable \(\Delta\)-coloring of graphs with low average degree
Theoretical Computer Science | 2006-03-20 | Paper |
On domination in connected cubic graphs
Discrete Mathematics | 2005-12-29 | Paper |
Nordhaus–Gaddum‐type Theorems for decompositions into many parts
Journal of Graph Theory | 2005-12-08 | Paper |
An extremal problem for H‐linked graphs
Journal of Graph Theory | 2005-12-08 | Paper |
On Two Conjectures on Packing of Graphs
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
European Journal of Combinatorics | 2005-09-29 | Paper |
Precoloring Extensions of Brooks' Theorem
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
On Equitable Coloring of d-Degenerate Graphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
On graphs with small Ramsey numbers. II.
Combinatorica | 2005-07-05 | Paper |
Even cycles in hypergraphs
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
Smaller planar triangle-free graphs that are not 3-list-colorable
Discrete Mathematics | 2005-04-18 | Paper |
scientific article; zbMATH DE number 2145236 (Why is no real title available?)
| 2005-03-14 | Paper |
Disjoint \(K_{r}\)-minors in large graphs with given average degree
European Journal of Combinatorics | 2005-03-08 | Paper |
On Ramsey Numbers of Sparse Graphs
Combinatorics, Probability and Computing | 2005-03-08 | Paper |
On the chromatic number of intersection graphs of convex sets in the plane
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Decomposing graphs into long paths
Order | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2079370 (Why is no real title available?)
| 2004-07-28 | Paper |
Homomorphisms from sparse graphs with large girth.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
Balanced edge colorings.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
A list analogue of equitable coloring
Journal of Graph Theory | 2004-02-03 | Paper |
Coloring uniform hypergraphs with few colors
Random Structures \& Algorithms | 2004-02-03 | Paper |
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
Mathematical Notes | 2003-06-15 | Paper |
Equitable Colourings of d-degenerate Graphs
Combinatorics, Probability and Computing | 2003-06-13 | Paper |
Degree conditions for k‐ordered hamiltonian graphs
Journal of Graph Theory | 2003-04-03 | Paper |
On deeply critical oriented graphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Vertex set partitions preserving conservativeness
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Local and mean Ramsey numbers for trees
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\)
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Equitable colorings of outerplanar graphs
Discrete Mathematics | 2002-12-02 | Paper |
Acyclic colouring of 1-planar graphs
Discrete Applied Mathematics | 2002-11-06 | Paper |
Transversals in uniform hypergraphs with property \((p,2)\)
Combinatorica | 2002-11-03 | Paper |
On graphs with small Ramsey numbers
Journal of Graph Theory | 2002-10-01 | Paper |
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
The Electronic Journal of Combinatorics | 2002-09-22 | Paper |
On nice graphs
Discrete Mathematics | 2002-08-08 | Paper |
Colouring relatives of intervals on the plane. II: Intervals and rays in two directions
European Journal of Combinatorics | 2002-08-07 | Paper |
Acyclic list 7‐coloring of planar graphs
Journal of Graph Theory | 2002-07-11 | Paper |
Total choosability of multicircuits I
Journal of Graph Theory | 2002-07-01 | Paper |
Total choosability of multicircuits II
Journal of Graph Theory | 2002-07-01 | Paper |
Density conditions for panchromatic colourings of hypergraphs
Combinatorica | 2002-06-25 | Paper |
The pagenumber of spherical lattices is unbounded
Arab Journal of Mathematical Sciences | 2002-05-21 | Paper |
Colorings and homomorphisms of degenerate and bounded degree graphs
Discrete Mathematics | 2002-04-16 | Paper |
Sparse sets in the complements of graphs with given girth
Discrete Mathematics | 2002-04-16 | Paper |
Choosability conjectures and multicircuits
Discrete Mathematics | 2002-04-09 | Paper |
On the chromatic number of set systems
Random Structures \& Algorithms | 2002-02-10 | Paper |
The number of q-ary words with restrictions on the length of the maximal run
Discrete Mathematics and Applications | 2001-08-16 | Paper |
scientific article; zbMATH DE number 1420988 (Why is no real title available?)
| 2001-07-16 | Paper |
On the number of edges in colour-critical graphs and hypergraphs
Combinatorica | 2001-06-13 | Paper |
scientific article; zbMATH DE number 1439469 (Why is no real title available?)
| 2001-02-20 | Paper |
Variable degeneracy: Extensions of Brooks' and Gallai's theorems
Discrete Mathematics | 2000-12-03 | Paper |
Colouring triangle-free intersection graphs of boxes on the plane
Discrete Mathematics | 2000-12-03 | Paper |
On universal graphs for planar oriented graphs of a given girth
Discrete Mathematics | 2000-11-02 | Paper |
Colour-critical graphs with few edges
Discrete Mathematics | 2000-11-02 | Paper |
On the independent domination number of graphs with given minimum degree
Discrete Mathematics | 2000-11-02 | Paper |
On kernel-perfect orientations of line graphs
Discrete Mathematics | 2000-11-02 | Paper |
The dimension of interior levels of the Boolean lattice. II
Order | 2000-10-22 | Paper |
Acyclic \(k\)-strong coloring of maps on surfaces
Mathematical Notes | 2000-10-16 | Paper |
On the Hajós number of graphs
Discrete Mathematics | 2000-09-27 | Paper |
Acyclic Colourings of Planar Graphs with Large Girth
Journal of the London Mathematical Society | 2000-07-04 | Paper |
On the number of edges in hypergraphs critical with respect to strong colourings
European Journal of Combinatorics | 2000-06-29 | Paper |
On degrees of vertices in paradoxical trees
Discrete Mathematics | 2000-06-07 | Paper |
Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
European Journal of Combinatorics | 2000-05-04 | Paper |
Transversals in uniform hypergraphs with property (7, 2)
Discrete Mathematics | 2000-02-22 | Paper |
scientific article; zbMATH DE number 1396798 (Why is no real title available?)
| 2000-01-31 | Paper |
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
Combinatorics, Probability and Computing | 2000-01-30 | Paper |
On Systems of Small Sets with No Large Δ-Subsystems
Combinatorics, Probability and Computing | 2000-01-11 | Paper |
scientific article; zbMATH DE number 1303523 (Why is no real title available?)
| 2000-01-09 | Paper |
scientific article; zbMATH DE number 1380611 (Why is no real title available?)
| 1999-12-19 | Paper |
On the maximum average degree and the oriented chromatic number of a graph
Discrete Mathematics | 1999-11-29 | Paper |
scientific article; zbMATH DE number 1341913 (Why is no real title available?)
| 1999-11-21 | Paper |
Hypercube subgraphs with local detours
| 1999-06-06 | Paper |
On large systems of sets with no large weak \(\Delta\)-subsystems
Combinatorica | 1999-05-18 | Paper |
The dimension of neighboring levels of the Boolean lattice
Order | 1999-02-03 | Paper |
scientific article; zbMATH DE number 1205985 (Why is no real title available?)
| 1998-10-04 | Paper |
Total colourings of planar graphs with large girth
European Journal of Combinatorics | 1998-04-07 | Paper |
Coloring relatives of intervals on the plane. I: Chromatic number versus girth
European Journal of Combinatorics | 1998-04-07 | Paper |
Intersection statements for systems of sets
Journal of Combinatorial Theory. Series A | 1997-11-25 | Paper |
scientific article; zbMATH DE number 1011262 (Why is no real title available?)
| 1997-10-26 | Paper |
Acyclic and oriented chromatic numbers of graphs
| 1997-10-20 | Paper |
Covering and coloring polygon-circle graphs
Discrete Mathematics | 1997-09-24 | Paper |
The colour theorems of Brooks and Gallai extended
Discrete Mathematics | 1997-09-24 | Paper |
Graphs without short odd cycles are nearly bipartite
Discrete Mathematics | 1997-09-24 | Paper |
Total colorings of planar graphs with large maximum degree
| 1997-09-17 | Paper |
List edge and list total colourings of multigraphs
Journal of Combinatorial Theory. Series B | 1997-09-15 | Paper |
A characterization of Seymour graphs
| 1997-08-31 | Paper |
The total chromatic number of any multigraph with maximum degree five is at most seven
Discrete Mathematics | 1997-06-10 | Paper |
An intersection theorem for systems of sets
| 1997-05-04 | Paper |
scientific article; zbMATH DE number 970806 (Why is no real title available?)
| 1997-03-11 | Paper |
Small transversals in uniform hypergraphs
Siberian Advances in Mathematics | 1996-08-28 | Paper |
scientific article; zbMATH DE number 850313 (Why is no real title available?)
| 1996-03-17 | Paper |
scientific article; zbMATH DE number 808809 (Why is no real title available?)
| 1996-03-17 | Paper |
scientific article; zbMATH DE number 808810 (Why is no real title available?)
| 1996-02-20 | Paper |
The number of spanning trees in graphs with a given degree sequence
Random Structures \& Algorithms | 1995-08-27 | Paper |
On set systems without weak 3-\(\Delta\)-subsystems
Discrete Mathematics | 1995-05-18 | Paper |
scientific article; zbMATH DE number 706829 (Why is no real title available?)
| 1995-05-18 | Paper |
scientific article; zbMATH DE number 714489 (Why is no real title available?)
| 1995-02-19 | Paper |
The 7/5‐conjecture strengthens itself
Journal of Graph Theory | 1995-02-01 | Paper |
The dimension of suborders of the Boolean lattice
Order | 1994-11-27 | Paper |
The dimension of interior levels of the Boolean lattice
Order | 1994-11-10 | Paper |
On the number of connected subgraphs with small edge‐boundary in regular graphs
Random Structures \& Algorithms | 1994-10-20 | Paper |
On the length of the Chinese postman tour in homogeneous graphs
| 1994-01-01 | Paper |
Covering boxes by points
Discrete Mathematics | 1993-11-01 | Paper |
The independent domination number of a cubic 3-connected graph can be much larger than its domination number
Graphs and Combinatorics | 1993-10-28 | Paper |
Radius and diameter of random subgraphs of the hypercube
Random Structures \& Algorithms | 1993-06-29 | Paper |
scientific article; zbMATH DE number 125468 (Why is no real title available?)
| 1993-02-21 | Paper |
scientific article; zbMATH DE number 125467 (Why is no real title available?)
| 1993-02-21 | Paper |
List edge chromatic number of graphs with large girth
Discrete Mathematics | 1993-01-16 | Paper |
scientific article; zbMATH DE number 26595 (Why is no real title available?)
| 1992-06-27 | Paper |
An upper bound of the cardinality of antichain boundary in the n-cube
Discrete Mathematics and Applications | 1992-06-25 | Paper |
scientific article; zbMATH DE number 10820 (Why is no real title available?)
| 1992-06-25 | Paper |
Matchings in random spanning subgraphs of cubelike graphs
Random Structures \& Algorithms | 1992-06-25 | Paper |
Complexity of computation of some functions of graphs
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4213994 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4200261 (Why is no real title available?)
| 1990-01-01 | Paper |
Locally Hamiltonian graphs
Mathematical Notes | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4093499 (Why is no real title available?)
| 1989-01-01 | Paper |
Small topological complete subgraphs of ``dense graphs
Combinatorica | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4108789 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4112636 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4079450 (Why is no real title available?)
| 1987-01-01 | Paper |
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
Thirteen Papers in Algebra | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4041964 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 4073007 (Why is no real title available?)
| 1985-01-01 | Paper |
Maximum set of edges no two covered by a clique
Combinatorica | 1985-01-01 | Paper |
Lower bound of the Hadwiger number of graphs by their average degree
Combinatorica | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3926948 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3924819 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3861194 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3838055 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3865318 (Why is no real title available?)
| 1982-01-01 | Paper |
A class of constructions for Turan's (3,4)-problem
Combinatorica | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3719178 (Why is no real title available?)
| 1980-01-01 | Paper |
On a problem of G. O. H. Katona and T. Tarján
Acta Mathematica Academiae Scientiarum Hungaricae | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3595210 (Why is no real title available?)
| 1978-01-01 | Paper |
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
Journal of Combinatorial Theory. Series B | 1977-01-01 | Paper |
The total coloring of a multigraph with maximal degree 4
Discrete Mathematics | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3659621 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3659620 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3603299 (Why is no real title available?)
| 1977-01-01 | Paper |
Note to the paper of Grünbaum on acyclic colorings
Discrete Mathematics | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3639666 (Why is no real title available?)
| 1976-01-01 | Paper |
Minimal abundant packings and choosability with separation
| N/A | Paper |
A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs
| N/A | Paper |
Ore-type conditions for existence of a jellyfish in a graph
| N/A | Paper |
