Publication | Date of Publication | Type |
---|
Disjoint Cycles in a Digraph with Partial Degree | 2023-03-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q5074393 | 2022-05-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5153483 | 2021-09-29 | Paper |
Disjoint directed cycles with specified lengths in directed bipartite graphs | 2021-03-25 | Paper |
Disjoint directed cycles in directed graphs | 2020-06-08 | Paper |
Disjoint cycles covering matchings in graphs with partial degrees | 2020-05-21 | Paper |
Vertex-disjoint double chorded cycles in bipartite graphs | 2019-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4614788 | 2019-01-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4616092 | 2019-01-30 | Paper |
Covering a graph with cycles of length at least 4 | 2018-05-25 | Paper |
Disjoint cycles in graphs with distance degree sum conditions | 2017-08-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q2820191 | 2016-09-14 | Paper |
Partial Degree Conditions and Cycle Coverings | 2015-03-24 | Paper |
DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS | 2014-09-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2876050 | 2014-08-15 | Paper |
Disjoint long cycles in a graph | 2014-03-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2869459 | 2014-01-03 | Paper |
Disjoint 5-cycles in a graph | 2012-11-08 | Paper |
Packing three copies of a tree into a complete bipartite graph | 2012-01-24 | Paper |
Proof of the Erdős-Faudree conjecture on quadrilaterals | 2010-12-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q3565858 | 2010-06-07 | Paper |
Packing two copies of a sparse graph into a graph with restrained maximum degree | 2009-12-18 | Paper |
Disjoint triangles and quadrilaterals in a graph | 2009-01-05 | Paper |
Pentagons and cycle coverings | 2007-03-20 | Paper |
Maximal total length of \(k\) disjoint cycles in bitpartite graphs | 2006-01-26 | Paper |
Existence of two disjoint long cycles in graphs | 2006-01-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5709012 | 2005-11-21 | Paper |
Disjoint directed quadrilaterals in a directed graph | 2005-11-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461447 | 2005-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q2716025 | 2005-07-20 | Paper |
Vertex-disjoint quadrilaterals in graphs | 2005-01-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4818782 | 2004-10-01 | Paper |
Covering vertices of a graph by \(k\) disjoint cycles | 2003-09-04 | Paper |
Independent directed triangles in a directed graph | 2002-07-22 | Paper |
On independent cycles in a bipartite graph | 2002-07-22 | Paper |
An extension of a theorem on cycles containing specified independent edges | 2002-05-15 | Paper |
On Covering a Bipartite Graph with Cycles | 2002-04-23 | Paper |
Large vertex-disjoint cycles in a bipartite graph | 2001-06-28 | Paper |
Proof of a conjecture on cycles in a bipartite graph | 2001-03-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4526401 | 2001-01-16 | Paper |
Vertex-disjoint cycles containing specified edges | 2001-01-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4488568 | 2000-12-11 | Paper |
Vertex-disjoint hexagons with chords in a bipartite graph | 2000-11-02 | Paper |
Triangles in claw-free graphs | 2000-11-02 | Paper |
Digraphs containing every possible pair of dicycles | 2000-10-18 | Paper |
On a conjecture on directed cycles in a directed bipartite graph | 2000-06-21 | Paper |
On the maximum number of independent cycles in a graph | 2000-05-08 | Paper |
Bipartite graphs containing every possible pair of cycles | 2000-05-08 | Paper |
On vertex-disjoint complete bipartite subgraphs in a bipartite graph | 2000-02-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4262234 | 1999-12-05 | Paper |
On 2-factors of a bipartite graph | 1999-11-10 | Paper |
Covering a graph with cycles | 1999-10-17 | Paper |
Vertex-disjoint triangles in claw-free graphs with minimum degree at least three | 1999-09-14 | Paper |
On quadrilaterals in a graph | 1999-09-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222092 | 1998-12-06 | Paper |
All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) | 1998-07-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4359583 | 1998-03-02 | Paper |
Packing two bipartite graphs into a complete bipartite graph | 1998-02-23 | Paper |
Partition of a directed bipartite graph into two directed cycles | 1998-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4349614 | 1997-12-07 | Paper |
Covering a graph with cycles passing through given edges | 1997-10-28 | Paper |
On long cycles in a 2-connected bipartite graph | 1997-06-22 | Paper |
On the maximum number of independent cycles in a bipartite graph | 1997-04-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5689003 | 1997-03-11 | Paper |
Packing two forests into a bipartite graph | 1996-10-07 | Paper |
Packing of three copies of a graph | 1996-08-18 | Paper |
Two vertex-disjoint cycles in a graph | 1996-02-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4858150 | 1995-12-12 | Paper |
Independent cycles with limited size in a graph | 1995-06-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4325294 | 1995-03-28 | Paper |
On \(K_{1,k}\)-factorizations of a complete bipartite graph | 1994-04-04 | Paper |
Path factors of bipartite graphs | 1994-01-01 | Paper |
\(P_{2p}\)-factorization of a complete bipartite graph | 1993-12-15 | Paper |
Partition of a bipartite graph into cycles | 1993-11-01 | Paper |
Packing three copies of a tree into a complete graph | 1993-05-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3751601 | 1986-01-01 | Paper |