Victor Neumann-Lara

Discret. Appl. Math., 2013

Molds of regular tournaments.

[BibT_eX]

Mika Olsen

Ars Comb., 2013

2009

On expansive graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Enumeration and dichromatic number of tame tournaments.

[BibT_eX]

[DOI]

Mika Olsen

Australas. J Comb., 2009

2008

On a heterochromatic number for hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2008

Circulant tournaments of prime order are tight.

[BibT_eX]

[DOI]

Bernardo Llano

Discret. Math., 2008

2006

Graph relations, clique divergence and surface triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

2005

Compact compatible topologies for graphs with small cycles.

[BibT_eX]

[DOI]

Richard G. Wilson

Int. J. Math. Math. Sci., 2005

An Anti-Ramsey Theorem on Cycles.

[BibT_eX]

[DOI]

Martín Eduardo Frías-Armenta

Graphs Comb., 2005

Local cutpoints and iterated clique graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph.

[BibT_eX]

Xueliang Li

Ars Comb., 2005

2004

A Note on Convex Decompositions of a Set of Points in the Plane.

[BibT_eX]

[DOI]

Graphs Comb., 2004

A note on minimally 3-connected graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

On the heterochromatic number of circulant digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

A hierarchy of self-clique graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

The clique operator on cographs and serial graphs.

[BibT_eX]

[DOI]

Célia Picinin de Mello

Aurora Morgana

Martín Eduardo Frías-Armenta

Discret. Math., 2004

Dismantlings and iterated clique graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

A Linear Heterochromatic Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2003

On a tree graph defined by a set of cycles.

[BibT_eX]

[DOI]

Xueliang Li

Discret. Math., 2003

2002

Whitney triangulations, local girth and iterated clique graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

On clique divergent graphs with linear growth.

[BibT_eX]

[DOI]

Discret. Math., 2002

An Anti-Ramsey Theorem.

[BibT_eX]

[DOI]

Comb., 2002

2001

On the homotopy type of the clique graph.

[BibT_eX]

J. Braz. Comput. Soc., 2001

Clique Divergent Clockwork Graphs and Partial Orders.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

Totally Multicoloured Cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Dichromatic number, circulant tournaments and Zykov sums of digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2000

A class of tight circulant tournaments.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2000

Locally C<sub>6</sub> graphs are clique divergent.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

A note on covering the edges of a graph with bonds.

[BibT_eX]

[DOI]

Discret. Math., 1999

The acyclic disconnection of a digraph.

[BibT_eX]

[DOI]

Discret. Math., 1999

Clique divergent graphs with unbounded sequence of diameters.

[BibT_eX]

[DOI]

Silvia Fernández-Merchant

Discret. Math., 1999

Tightness problems in the plane.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Jorge L. Arocha

Discret. Math., 1999

1998

New classes of critical kernel-imperfect digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1998

1997

A Family of Clique Divergent Graphs with Linear Growth.

[BibT_eX]

[DOI]

Graphs Comb., 1997

Euler tours and a game with dominoes.

[BibT_eX]

[DOI]

Discret. Math., 1997

Vertex critical 4-dichromatic circulant tournaments.

[BibT_eX]

[DOI]

Gregorio Hernández-Peñalver

Discret. Math., 1997

A Combinatorial Property of Convex Sets.

[BibT_eX]

[DOI]

Manuel Abellanas

Rolf Klein

Discret. Comput. Geom., 1997

1996

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1996

1995

Tight and Untight Triangulations of Surfaces by Complete Graphs.

[BibT_eX]

[DOI]

Jorge L. Arocha

Javier Bracho

Gregorio Hernández-Peñalver

J. Comb. Theory, Ser. B, 1995

Voronoi Diagrams and Containment of Families of Convex Sets on the Plane.

[BibT_eX]

[DOI]

Manuel Abellanas

Rolf Klein

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

A Short Proof of a Theorem of Reid and Parker on Tournaments.

[BibT_eX]

[DOI]

Graphs Comb., 1994

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1994

The 3 and 4-dichromatic tournaments of minimum order.

[BibT_eX]

[DOI]

Discret. Math., 1994

1992

On the minimum size of tight hypergraphs.

[BibT_eX]

[DOI]

Jorge L. Arocha

Javier Bracho

J. Graph Theory, 1992

1991

Extending kernel perfect digraphs to kernel perfect critical digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

Orientations of graphs in kernel theory.

[BibT_eX]

[DOI]

Discret. Math., 1991

Spanning trees with bounded degrees.

[BibT_eX]

[DOI]

Comb., 1991

1988

A combinatorial result on points and circles on the plane.

[BibT_eX]

[DOI]

Discret. Math., 1988

On multiplicative graphs and the product conjecture.

[BibT_eX]

[DOI]

Comb., 1988

1986

Uniquely colourable m-dichromatic oriented graphs.

[BibT_eX]

[DOI]

Nicola Santoro

Discret. Math., 1986

On kernel-perfect critical digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1986

1984

A variation of Menger's theorem for long paths.

[BibT_eX]

[DOI]

Luis Montejano

J. Comb. Theory, Ser. B, 1984

Vertex critical r-dichromatic tournaments.

[BibT_eX]

[DOI]

Discret. Math., 1984

On kernels and semikernels of digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

1982

The dichromatic number of a digraph.

[BibT_eX]

[DOI]