Yair Caro

Balázs Patkós

Ars Math. Contemp., 2024

2023

Sum-distinguishing number of sparse hypergraphs.

[BibT_eX]

[DOI]

Maria Axenovich

Eur. J. Comb., August, 2023

Remarks on proper conflict-free colorings of graphs.

[BibT_eX]

[DOI]

Mirko Petrusevski

Riste Skrekovski

Discret. Math., 2023

The feasibility problem for line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Graphs with constant balancing number.

[BibT_eX]

[DOI]

Ileana González-Escalante

Tonatiuh Matos Wiederhold

Mariel Jácome

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

On small balanceable, strongly-balanceable and omnitonal graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

New results relating inependence and matchings.

[BibT_eX]

[DOI]

Randy Davila

Discuss. Math. Graph Theory, 2022

Index of parameters of iterated line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Remarks on odd colorings of graphs.

[BibT_eX]

[DOI]

Mirko Petrusevski

Riste Skrekovski

Discret. Appl. Math., 2022

On Zero-Sum Spanning Trees and Zero-Sum Connectivity.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Unavoidable chromatic patterns in 2-colorings of the complete graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Recursive constructions of amoebas.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Induced subgraphs with many repeated degrees.

[BibT_eX]

[DOI]

Discret. Math., 2020

A note on totally-omnitonal graphs.

[BibT_eX]

[DOI]

Bull. ICA, 2020

Regular Turán numbers.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

Zero-sum subsequences in bounded-sum {-1, 1}-sequences.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Zero-Sum Km Over Z and the Story of K4.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Extremal k-forcing sets in oriented graphs.

[BibT_eX]

[DOI]

Randy Davila

Discret. Appl. Math., 2019

Irregular independence and irregular domination.

[BibT_eX]

[DOI]

Peter Borg

Kurt Fenech

Discret. Appl. Math., 2019

Notes on spreads of degrees in graphs.

[BibT_eX]

[DOI]

Bull. ICA, 2019

2018

The Effect of Local Majority on Global Majorityin Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

2017

Ramsey numbers for degree monotone paths.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Selective hypergraph colourings.

[BibT_eX]

[DOI]

Discret. Math., 2016

Regular independent sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Isolation in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

The saturation number for the length of degree monotone paths.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Constrained colouring and σ-hypergraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

(2, 2)-colourings and clique-free σ-hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Upper bounds on the k-forcing number of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Barycentric and zero-sum Ramsey numbers.

[BibT_eX]

Ars Comb., 2015

Independence and matchings in σ-hypergraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2015

2014

Simultaneous Domination in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Non-monochromatic non-rainbow colourings of σ-hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Forcing $k$-repetitions in Degree Sequences.

[BibT_eX]

[DOI]

Asaf Shapira

Electron. J. Comb., 2014

Degree sequence index strategy.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

2013

Partitions of graphs into small and large sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

New Approach to the k-Independence Number of a Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Fair domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Directed domination in oriented graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Colorful monochromatic connectivity.

[BibT_eX]

[DOI]

Discret. Math., 2011

A Greedy Partition Lemma for directed domination.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Equitable Hypergraph Orientations.

[BibT_eX]

[DOI]

Douglas B. West

Electron. J. Comb., 2011

2010

Large induced subgraphs with equated maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Large disjoint subgraphs with the same order and size.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Repetition Number of Graphs.

[BibT_eX]

[DOI]

Douglas B. West

Electron. J. Comb., 2009

2008

On Rainbow Connection.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Reconstructing graphs from size and degree properties of their induced k-subgraphs.

[BibT_eX]

[DOI]

Dieter Rautenbach

Discret. Math., 2007

2005

Connected odd dominating sets in graphs.

[BibT_eX]

[DOI]

William Klostermeyer

Discuss. Math. Graph Theory, 2005

2004

Edge coloring complete uniform hypergraphs with many components.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Connected colorings of graphs.

[BibT_eX]

Ars Comb., 2004

2003

On non-z(mod k) dominating sets.

[BibT_eX]

[DOI]

Michael S. Jacobson

Discuss. Math. Graph Theory, 2003

2-connected graphs with small 2-connected dominating sets.

[BibT_eX]

[DOI]

Discret. Math., 2003

The Order of Monochromatic Subgraphs with a Given Minimum Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

Some results in step domination of graphs.

[BibT_eX]

Arieh Lev

Ars Comb., 2003

2002

Zero-sum Square Matrices.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

List decomposition of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

On colored designs-III: on lambda-colored H-designs, H having lambda edges.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Covering Non-uniform Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Odd and residue domination numbers of a graph.

[BibT_eX]

[DOI]

John L. Goldwasser

William Klostermeyer

Discuss. Math. Graph Theory, 2001

Asymptotic Bounds for Bipartite Ramsey Numbers.

[BibT_eX]

[DOI]

Cecil C. Rousseau

Electron. J. Comb., 2001

2000

Connected Domination and Spanning Trees with Many Leaves.

[BibT_eX]

[DOI]

Douglas B. West

SIAM J. Discret. Math., 2000

A characterization of Zm-well-covered graphs of girth 6 or more.

[BibT_eX]

[DOI]

Bert L. Hartnell

J. Graph Theory, 2000

Intersecting Designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 2000

Dominating A Family Of Graphs With Small Connected Subgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

Graphs with Large Variance.

[BibT_eX]

Ars Comb., 2000

Covering designs with minimum overlap.

[BibT_eX]

Ars Comb., 2000

Improved bounds for the product of the domination and chromatic numbers of a graph.

[BibT_eX]

Ars Comb., 2000

1999

Zero-sum delta-systems and multiple copies of graphs.

[BibT_eX]

[DOI]

Christian Provstgaard

J. Graph Theory, 1999

Orthogonal Decomposition and Packing of Complete Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1999

Graph Decomposition of Slim Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1999

The uniformity space of hypergraphs and its applications.

[BibT_eX]

[DOI]

Discret. Math., 1999

Orthogonal Colorings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Graphs Having the Local Decomposition Property.

[BibT_eX]

Ars Comb., 1999

1998

Local Structure When All Maximal Independent Sets Have Equal Weight.

[BibT_eX]

[DOI]

Mark N. Ellingham

J. E. Ramey

SIAM J. Discret. Math., 1998

The characterization of zero-sum (mod 2) bipartite Ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Covering Graphs: The Covering Problem Solved.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1998

On graphs determined by their k-subgraphs.

[BibT_eX]

Ars Comb., 1998

1997

Subdivisions, parity and well-covered graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Binomial Coefficients and Zero-Sum Ramsey Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Recognizing Global Occurrence of Local Properties.

[BibT_eX]

[DOI]

J. Complex., 1997

On colored designs - I.

[BibT_eX]

[DOI]

Discret. Math., 1997

Efficient Covering Designs of the Complete Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Packing Graphs: The packing problem solved.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

1996

Recognizing Greedy Structures.

[BibT_eX]

[DOI]

András Sebö

Michael Tarsi

J. Algorithms, 1996

On the generalized Erdös-Szekeres Conjecture - a new upper bound.

[BibT_eX]

[DOI]

Discret. Math., 1996

Zero-sum problems - A survey.

[BibT_eX]

[DOI]

Discret. Math., 1996

Simple proofs to three parity theorems.

[BibT_eX]

Ars Comb., 1996

1995

On colored designs - II.

[BibT_eX]

[DOI]

Discret. Math., 1995

A zero-sum conjecture for trees.

[BibT_eX]

Ars Comb., 1995

Exact cuts and a simple proof of the zero graphs theorem.

[BibT_eX]

Ars Comb., 1995

1994

A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers.

[BibT_eX]

J. Comb. Theory A, 1994

On induced subgraphs of trees, with restricted degrees.

[BibT_eX]

[DOI]

Ilia Krasikov

Discret. Math., 1994

On induced subgraphs with odd degrees.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

On three zero-sum Ramsey-type problems.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Bounded degrees and prescribed distances in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Bisection of trees and sequences.

[BibT_eX]

[DOI]

Ilia Krasikov

Discret. Math., 1993

1992

On several variations of the turan and ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

On zero-sum Ramsey numbers - stars.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Improved lower bounds on k-independence.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

On the largest tree of given maximum degree in a connected graph.

[BibT_eX]

[DOI]

Ilia Krasikov

J. Graph Theory, 1991

On zero-sum delta-systems and multiple copies of hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Hypergraph coverings and local colorings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

1990

A note on packing trees into complete bipartite graphs and on fishburn's conjecture.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

Combinatorial reconstruction problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

Sub-Ramsey numbers for arithmetic progressions.

[BibT_eX]

[DOI]

Graphs Comb., 1989

1987

Extremal problems concerning transformations of the edges of the complete hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

1986

Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 1986

1984

The decomposition of trees into subtrees.

[BibT_eX]

[DOI]

J. Graph Theory, 1984

1981

Generalized 1-factorization of trees.

[BibT_eX]

[DOI]