Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • 2005-03-30 Paper Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles 2003-07-30 Paper Cycle decompositions of \(K_n\) and \(K_n-I\)...
    10 bytes (18 words) - 08:09, 9 December 2023
  • Paper Path-path Ramsey type numbers for the complete bipartite graph 1975-01-01 Paper Path Ramsey numbers in multicolorings 1975-01-01 Paper Path connected...
    10 bytes (19 words) - 20:14, 8 December 2023
  • problem at Singapore MRT 2002-08-20 Paper A multicriteria Pareto-optimal path algorithm 1993-01-04 Paper Cyclic Schedule for Apron Services 1991-01-01...
    10 bytes (18 words) - 12:32, 13 December 2023
  • de/entity/Q2941400 2015-08-28 Paper Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices 2015-08-05 Paper Uniformly...
    10 bytes (16 words) - 09:26, 9 December 2023
  • eigenvalue 2002-08-15 Paper Fan‐type theorem for path‐connectivity 2002-07-01 Paper Degree sums and path-factors in graphs 2002-06-27 Paper Degree sums,...
    10 bytes (17 words) - 22:34, 8 December 2023
  • https://portal.mardi4nfdi.de/entity/Q2848784 2013-09-26 Paper New results on path-decompositions and their down-links 2013-09-26 Paper BIB-designs from circular nearrings...
    10 bytes (19 words) - 01:35, 10 December 2023
  • K-distinct branchings admits a polynomial kernel 2023-09-20 Paper Strong arc decompositions of split digraphs 2023-09-13 Paper Complexity of (arc)-connectivity...
    10 bytes (19 words) - 16:15, 10 December 2023
  • 2017-10-09 Paper Efficient and robust path openings using the scale-invariant rank operator 2016-10-31 Paper Path-Based Mathematical Morphology on Tensor...
    10 bytes (22 words) - 15:12, 9 December 2023
  • combinatorial interpretation of punctured partitions 2001-02-06 Paper The cycle-path indicator polynomial of a digraph 2000-11-16 Paper The complementary symmetric...
    10 bytes (18 words) - 14:32, 28 January 2024
  • Discrete systolic inequalities and decompositions of triangulated surfaces 2015-06-18 Paper Shortest vertex-disjoint two-face paths in planar graphs 2014-09-09...
    10 bytes (21 words) - 14:08, 10 December 2023
  • Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) 2010-04-27 Paper Edge-decompositions ofKn,ninto isomorphic copies of a given...
    10 bytes (18 words) - 00:19, 11 December 2023
  • Special Structures 2014-10-09 Paper Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck 2013-10-10 Paper Completing partial...
    10 bytes (17 words) - 22:01, 10 December 2023
  • 2022-07-21 Paper Finding Branch-Decompositions of Matroids, Hypergraphs, and More 2021-12-01 Paper Obstructions for matroids of path-width at most k and graphs...
    10 bytes (17 words) - 19:22, 6 October 2023
  • de/entity/Q4053701 1974-01-01 Paper Graphs in which every path is contained in a Hamilton path. 1974-01-01 Paper A minimal condition implying a special...
    10 bytes (17 words) - 17:15, 9 December 2023
  • lattice path matroids and polymatroids 2011-10-21 Paper Convex-ear decompositions and the flag \(h\)-vector 2011-02-17 Paper A Convex-Ear Decomposition for...
    10 bytes (16 words) - 20:11, 6 October 2023
  • 2004-08-11 Paper Decompositions for the edge colouring of reduced indifference graphs. 2003-08-17 Paper Recognizing clique graphs of directed edge path graphs 2003-03-09...
    10 bytes (16 words) - 22:07, 10 December 2023
  • Paper New Behavior in Legal Decompositions Arising from Non-positive Linear Recurrences 2018-11-21 Paper Legal Decompositions Arising from Non-positive Linear...
    10 bytes (16 words) - 16:59, 11 December 2023
  • Publication Date of Publication Type Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs 2016-05-25 Paper...
    10 bytes (18 words) - 15:02, 10 December 2023
  • Date of Publication Type On operator valued Haar unitaries and bipolar decompositions of R-diagonal elements 2024-04-04 Paper Experiments on an elliptic circulation...
    10 bytes (18 words) - 09:28, 13 December 2023
  • Augmentation with Bounded Costs 2018-07-16 Paper Robust Assignments via Ear Decompositions and Randomized Rounding 2017-12-19 Paper Non-Uniform Robust Network...
    10 bytes (16 words) - 06:23, 12 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)