Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • finite set containing no two disjoint sets and their union 1968-01-01 Paper On a conjecture of milner on k-graphs with non-disjoint edges 1968-01-01 Paper...
    10 bytes (19 words) - 03:41, 9 December 2023
  • induce $3k$-cycles 2014-08-09 Paper Multicut is FPT 2014-06-05 Paper A counterexample to a conjecture of Schwartz 2014-05-30 Paper Disjoint 3‐Cycles in Tournaments:...
    10 bytes (17 words) - 07:10, 9 December 2023
  • 2015-12-23 Paper Arbitrary Orientations of Hamilton Cycles in Digraphs 2015-09-02 Paper Edge-disjoint Hamilton cycles in random graphs 2015-05-29 Paper The robust...
    10 bytes (17 words) - 23:39, 9 December 2023
  • Paper Packing disjoint cycles over vertex cuts 2010-05-28 Paper On F-independence in graphs 2010-05-14 Paper Packing edge-disjoint cycles in graphs and...
    10 bytes (16 words) - 02:39, 9 December 2023
  • about disjoint dominating sets 2009-12-15 Paper On spanning tree congestion 2009-12-10 Paper Domination in graphs of minimum degree at least two and large...
    10 bytes (16 words) - 01:27, 10 December 2023
  • de/entity/Q4269174 1999-10-31 Paper Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles 1999-07-07 Paper Small bases for finite groups...
    10 bytes (17 words) - 19:58, 8 December 2023
  • with neither 3-cycles nor adjacent 4-cycles 2013-06-26 Paper Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally...
    10 bytes (17 words) - 02:38, 10 December 2023
  • dimension 2021-11-10 Paper Bounds on metric dimensions of graphs with edge disjoint cycles 2021-11-09 Paper https://portal.mardi4nfdi.de/entity/Q5159218 2021-10-26...
    10 bytes (17 words) - 20:26, 8 December 2023
  • diameter two critical graphs. II. 2012-01-11 Paper Solving MAX-\(r\)-SAT above a tight lower bound 2011-11-07 Paper Kernel bounds for disjoint cycles and disjoint...
    10 bytes (16 words) - 10:09, 8 December 2023
  • Paper Two-Stage Robust Network Design with Exponential Scenarios 2008-11-25 Paper Approximability of Packing Disjoint Cycles 2008-05-27 Paper Disjoint Cycles:...
    10 bytes (18 words) - 21:25, 9 December 2023
  • Paper Many-to-many two-disjoint path covers in cylindrical and toroidal grids 2015-04-28 Paper The bicube: an interconnection of two hypercubes 2015-03-25...
    10 bytes (18 words) - 11:03, 6 October 2023
  • Few Longest Cycles 2022-04-01 Paper Long cycles and spanning subgraphs of locally maximal 1‐planar graphs 2022-03-31 Paper Hamiltonian cycles and 1-factors...
    10 bytes (18 words) - 18:11, 11 December 2023
  • Hamiltonian cycles in regular 3-connected claw-free graphs 1998-02-16 Paper Longest cycles in regular 2-connected claw-free graphs 1995-05-31 Paper Two edge-disjoint...
    10 bytes (17 words) - 17:52, 9 December 2023
  • infinitely long pipe with Navier boundary conditions 2023-04-21 Paper Disjoint Cycles in a Digraph with Partial Degree 2023-03-30 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 22:32, 9 December 2023
  • placements for two-dimensional toroidal networks 2005-06-30 Paper Quasi-perfect Lee distance codes 2005-06-01 Paper Edge-disjoint Hamiltonian cycles in two-dimensional...
    10 bytes (16 words) - 07:41, 12 December 2023
  • altitude of a graph 2019-02-13 Paper Biased graphs with no two vertex-disjoint unbalanced cycles 2018-04-18 Paper When does a biased graph come from a group...
    10 bytes (16 words) - 23:39, 9 December 2023
  • 2009-05-08 Paper Disjoint cycles with chords in graphs 2009-02-20 Paper Subdivisions of graphs: A generalization of paths and cycles 2008-09-04 Paper Pseudo...
    10 bytes (18 words) - 20:16, 11 December 2023
  • become very easy 2021-12-14 Paper Disjoint paths and connected subgraphs for \(H\)-free graphs 2021-12-01 Paper Induced disjoint paths in AT-free graphs 2021-11-25...
    10 bytes (16 words) - 13:28, 8 December 2023
  • computing \(k\) disjoint constrained shortest paths 2016-10-20 Paper Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints...
    10 bytes (16 words) - 06:02, 7 October 2023
  • planar graphs 1994-09-25 Paper Two edge-disjoint hamiltonian cycles in the butterfly graph 1994-09-25 Paper Postman tours and cycle covers 1993-12-20 Paper https://portal...
    10 bytes (17 words) - 20:51, 8 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)