Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • de/entity/Q2715971 2005-07-20 Paper Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles 2003-07-30 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 12:25, 13 December 2023
  • 2014-12-02 Paper EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS 2014-04-25 Paper Directed acyclic graphs with the unique dipath property 2014-01-16...
    10 bytes (19 words) - 11:24, 9 December 2023
  • bases of the cycle space 1986-01-01 Paper A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles 1985-01-01...
    10 bytes (16 words) - 00:33, 13 December 2023
  • 2016-06-21 Paper Hamiltonian cycles in spanning subgraphs of line graphs 2016-06-21 Paper A note on edge-disjoint Hamilton cycles in line graphs 2016-06-13...
    10 bytes (17 words) - 15:04, 10 December 2023
  • number of cycles and paths 2020-07-17 Paper 2-factors with \(k\) cycles in Hamiltonian graphs 2020-07-07 Paper Long directed rainbow cycles and rainbow...
    10 bytes (17 words) - 10:55, 9 December 2023
  • cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs 2012-12-27 Paper Notes on heavy cycles in weighted digraphs 2012-10-17 Paper...
    10 bytes (18 words) - 22:19, 9 December 2023
  • 2003-09-07 Paper Saddle-focus singular cycles and prevalence of hyperbolicity 2000-04-03 Paper Contracting singular cycles 1998-10-27 Paper...
    10 bytes (20 words) - 11:39, 11 December 2023
  • Connectivity of a Directed Graph 2021-01-27 Paper 2-Connectivity in Directed Graphs: An Experimental Study 2019-09-12 Paper 2-Edge Connectivity in Directed Graphs...
    10 bytes (16 words) - 01:47, 10 December 2023
  • of 3-cycles 1997-03-06 Paper https://portal.mardi4nfdi.de/entity/Q4293583 1994-07-18 Paper Hamiltonian tournaments with the least number of 3-cycles 1990-01-01...
    10 bytes (16 words) - 23:40, 12 December 2023
  • complete graphs and eulerian cycles in edge-colored graphs : some complexity results 1997-01-07 Paper The forwarding index of directed networks 1996-10-09 Paper...
    10 bytes (17 words) - 13:42, 28 January 2024
  • forcing Hamilton cycles in directed graphs 2013-10-10 Paper Short cycles in oriented graphs 2013-10-10 Paper Optimal Packings of Hamilton Cycles in Graphs of...
    10 bytes (17 words) - 23:39, 9 December 2023
  • the Winding Number of a Directed Polymer on a Cylinder 2023-08-08 Paper Localization length of the \(1+1\) continuum directed random polymer 2023-06-20...
    10 bytes (17 words) - 20:37, 9 December 2023
  • An improved bound for the monochromatic cycle partition number 2007-01-16 Paper Odd cycles and \(\Theta\)-cycles in hypergraphs 2006-10-30 Paper Hall ratio...
    10 bytes (17 words) - 17:12, 9 December 2023
  • 2022-05-31 Paper On even rainbow or nontriangular directed cycles 2022-02-03 Paper On odd rainbow cycles in edge-colored graphs 2021-04-14 Paper Distributed...
    10 bytes (16 words) - 11:23, 8 December 2023
  • Turán number of directed paths and oriented cycles 2023-04-28 Paper Stability of Woodall's theorem and spectral conditions for large cycles 2023-03-21 Paper...
    10 bytes (17 words) - 21:55, 9 December 2023
  • 2010-04-21 Paper Maximum directed cuts in digraphs with degree restriction 2009-06-16 Paper The \(k\)-fold list coloring of cycles with Hall's condition 2009-04-14...
    10 bytes (17 words) - 20:14, 8 December 2023
  • of Hamilton cycles 1989-01-01 Paper Rigidity of horospherical foliations 1989-01-01 Paper When the cartesian product of two directed cycles is hyperhamiltonian...
    10 bytes (18 words) - 12:40, 28 January 2024
  • Paper Ramsey Goodness of Cycles 2020-10-27 Paper On the odd cycle game and connected rules 2020-09-15 Paper 2-factors with \(k\) cycles in Hamiltonian graphs...
    10 bytes (16 words) - 02:06, 11 December 2023
  • the restricted size Ramsey number for a pair of cycles 2024-02-19 Paper Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree...
    10 bytes (17 words) - 19:58, 8 December 2023
  • 2017-09-29 Paper Finding shortest non-trivial cycles in directed graphs on surfaces 2017-03-30 Paper A Direct Proof of the Strong Hanani–Tutte Theorem on...
    10 bytes (21 words) - 14:08, 10 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)