Michael Tarsi

J. Graph Theory, 2020

2017

Flows and Bisections in Cubic Graphs.

[BibT_eX]

[DOI]

Louis Esperet

Giuseppe Mazzuoccolo

J. Graph Theory, 2017

2011

Short cycle covers of graphs and nowhere-zero flows.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

2009

Greedily constructing maximal partial f-factors.

[BibT_eX]

[DOI]

Discret. Math., 2009

Some results on (a: b)-choosability.

[BibT_eX]

[DOI]

Shai Gutner

Discret. Math., 2009

2008

Some results on (a:b)-choosability

[BibT_eX]

[DOI]

Shai Gutner

CoRR, 2008

2007

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests.

[BibT_eX]

[DOI]

Discret. Math., 2007

2005

Multigraph decomposition into stars and into multistars.

[BibT_eX]

[DOI]

Miri Priesler

Discret. Math., 2005

2004

On some multigraph decomposition problems and their computational complexity.

[BibT_eX]

[DOI]

Miri Priesler

Discret. Math., 2004

1998

On (<i>k</i>, <i>d</i>)-colorings and fractional nowhere-zero flows.

[BibT_eX]

[DOI]

Luis A. Goddyn

Cun-Quan Zhang

J. Graph Theory, 1998

Flows, View Obstructions, and the Lonely Runner.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1998

1997

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.

[BibT_eX]

[DOI]

Dorit Dor

SIAM J. Comput., 1997

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1997

A Note on Graph Colorings and Graph Polynomials.

[BibT_eX]

[DOI]

Noga Alon

J. Comb. Theory, Ser. B, 1997

1996

Graphs Where Every Maximal Path Is Maximum.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Well-Covered Claw-Free Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Recognizing Greedy Structures.

[BibT_eX]

[DOI]

Yair Caro

András Sebö

J. Algorithms, 1996

1992

Short cycle covers and the cycle double cover conjecture.

[BibT_eX]

[DOI]

Ury Jamshy

J. Comb. Theory, Ser. B, 1992

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1992

Colorings and orientations of graphs.

[BibT_eX]

[DOI]

Noga Alon

Comb., 1992

Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture

[BibT_eX]

[DOI]

Dorit Dor

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

NP-Completeness of graph decomposition problems.

[BibT_eX]

[DOI]

Edith Cohen

J. Complex., 1991

1989

Cycle covering of binary matroids.

[BibT_eX]

[DOI]

Ury Jamshy

J. Comb. Theory, Ser. B, 1989

Interpolation Between Bases and the Shuffle Exchange Network.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

A nowhere-zero point in liner mappings.

[BibT_eX]

[DOI]

Noga Alon

Comb., 1989

1988

Matroidal bijections between graphs.

[BibT_eX]

[DOI]

Roy Meshulam

J. Comb. Theory, Ser. B, 1988

1987

Short circuit covers for regular matroids with a nowhere zero 5-flow.

[BibT_eX]

[DOI]

Ury Jamshy

André Raspaud

J. Comb. Theory, Ser. B, 1987

1986

Semi-duality and the cycle double cover conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1986

Structuring causal trees.

[BibT_eX]

[DOI]

Judea Pearl

J. Complex., 1986

1985

Deciding Hypergraph 2-Colourability by H-Resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Nowhere zero flow and circuit covering in regular matroids.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1985

1983

Optimal Search on Some Game Trees

[BibT_eX]

[DOI]

J. ACM, July, 1983

Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1983

1982

The Counterfeit Coin Problem Revisited.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

1981

On the decomposition of a graph into stars.

[BibT_eX]

[DOI]

Discret. Math., 1981

1979

Decomposition of complete multigraphs into stars.

[BibT_eX]

[DOI]