Yubao Guo

Discret. Appl. Math., 2022

2021

Oriented diameter of maximal outerplanar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

2020

Vertex-disjoint cycles in local tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2020

2018

Oriented diameter of graphs with given maximum degree.

[BibT_eX]

[DOI]

Peter Dankelmann

J. Graph Theory, 2018

Miscellaneous Digraph Classes.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

2017

The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model.

[BibT_eX]

[DOI]

Mujiangshan Wang

Shiying Wang

Int. J. Comput. Math., 2017

Universal arcs in local tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Conditional fault tolerance in a class of Cayley graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

On pancyclic arcs in hypertournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs.

[BibT_eX]

[DOI]

Shiying Wang

Kai Feng

Int. J. Found. Comput. Sci., 2015

Pancyclic out-arcs of a vertex in a hypertournament.

[BibT_eX]

[DOI]

Australas. J Comb., 2015

2014

The H-force set of a hypertournament.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Signed cycle domination numbers of digraphs.

[BibT_eX]

Ars Comb., 2014

2013

Notes on vertex pancyclicity of graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Mei Lu

Discret. Math., 2013

On the vertex-pancyclicity of hypertournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Restricted arc-connectivity in tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Restricted arc-connectivity of bipartite tournaments.

[BibT_eX]

[DOI]

Steffen Grüter

Andreas Holtkamp

Discret. Appl. Math., 2013

Cycles through a given arc and certain partite sets in strong multipartite tournaments.

[BibT_eX]

[DOI]

Australas. J Comb., 2013

Connectivity of local tournaments.

[BibT_eX]

[DOI]

Andreas Holtkamp

Sebastian Milz

Australas. J Comb., 2013

2012

Weakly quasi-Hamiltonian-set-connected multipartite tournaments.

[BibT_eX]

[DOI]

Mei Lu

Discret. Appl. Math., 2012

2011

Cycles through arcs in multipartite tournaments and a conjecture of Volkmann.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

Three supplements to Reid's theorem in multipartite tournaments.

[BibT_eX]

[DOI]

Shengjia Li

Wei Meng

Discret. Appl. Math., 2010

Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian.

[BibT_eX]

[DOI]

Ruijuan Li

Shengjia Li

Discret. Appl. Math., 2010

Out-arc pancyclicity of vertices in tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

2008

Hamiltonian problem on claw-free and almost distance-hereditary graphs.

[BibT_eX]

[DOI]

Jinfeng Feng

Discret. Math., 2008

2007

A local tournament contains a vertex whose out-arcs are <i>g</i>-pancyclic.

[BibT_eX]

Shengjia Li

Wei Meng

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Characterization of edge-colored complete graphs with properly colored Hamilton paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

2004

Extendable Cycles in Multipartite Tournaments.

[BibT_eX]

[DOI]

Graphs Comb., 2004

2000

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.

[BibT_eX]

[DOI]

Discret. Math., 2000

Complementary cycles containing prescribed vertices in tournaments.

[BibT_eX]

[DOI]

Anders Yeo

Discret. Math., 2000

Pancyclic out-arcs of a Vertex in Tournaments.

[BibT_eX]

[DOI]

Tianxing Yao

Kemin Zhang

Discret. Appl. Math., 2000

1999

A note on vertex pancyclic oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

The cycle structure of regular multipartite tournaments.

[BibT_eX]

[DOI]

Jin Ho Kwak

Electron. Notes Discret. Math., 1999

Outpaths in Semicomplete Multipartite Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

A New Sufficient Condition for a Digraph to Be Hamiltonian.

[BibT_eX]

[DOI]

Anders Yeo

Discret. Appl. Math., 1999

1997

On cycles through a given vertex in multipartite tournaments.

[BibT_eX]

[DOI]

Axel Pinkernell

Discret. Math., 1997

Path-connectivity in local tournaments.

[BibT_eX]

[DOI]

Discret. Math., 1997

A classification of locally semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Bypaths in Tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Spanning Local Tournaments in Locally Semicomplete Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

Locally semicomplete digraphs that are complementary <i>m</i>-pancyclic.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Strongly Hamiltonian-connected locally semicomplete digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Weakly Hamiltonian-connected locally semicomplete digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

1995

A generalization of menger's theorem for certain block - cactus graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1995

1994

Connectivity properties of locally semicomplete digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1994

Cycles in Multipartite Tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1994

On complementary cycles in locally semicomplete digraphs.

[BibT_eX]

[DOI]