Search results
From MaRDI portal
- Publication Date of Publication Type Hierarchical cycle-tree packing model for optimal \(K\)-core attack 2024-01-02 Paper Spin Glass approach to the feedback...10 bytes (17 words) - 00:29, 12 December 2023
- binary sequences 2010-10-18 Paper On packing shortest cycles in graphs 2010-08-20 Paper Packing edge-disjoint cycles in graphs and the cyclomatic number...10 bytes (16 words) - 04:13, 7 October 2023
- 2017-06-09 Paper Container packing problem with balance constraints 2014-12-11 Paper A hybrid genetic algorithm with a new packing strategy for the three-dimensional...10 bytes (18 words) - 07:27, 9 December 2023
- graphs 2016-02-19 Paper Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle 2015-12-11 Paper Combined Degree and Connectivity...10 bytes (16 words) - 20:53, 9 December 2023
- sampling 2023-10-23 Paper Fractional cycle decompositions in hypergraphs 2023-10-17 Paper Counting Hamilton cycles in Dirac hypergraphs 2023-03-30 Paper...10 bytes (16 words) - 21:58, 9 December 2023
- 2018-05-24 Paper An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs 2016-08-31 Paper Moderately exponential time algorithms...10 bytes (19 words) - 21:31, 8 December 2023
- Adding random edges to create the square of a Hamilton cycle 2017-10-07 Paper Loose Hamilton Cycles in Regular Hypergraphs 2017-10-04 Paper An Alternative...10 bytes (17 words) - 01:27, 10 December 2023
- 2018-07-11 Paper BPPLIB: a library for bin packing and cutting stock problems 2018-04-19 Paper Bin packing and cutting stock problems: mathematical models...10 bytes (16 words) - 00:59, 25 September 2023
- 2014-06-27 Paper Rainbow matchings and cycle-free partial transversals of Latin squares 2014-05-06 Paper Packing trees into \(n\)-chromatic graphs 2014-04-02...10 bytes (17 words) - 17:12, 9 December 2023
- Hamiltonian cycle 2000-03-21 Paper Coloring edges of self-complementary graphs 1998-05-06 Paper Embedding digraphs of small size 1998-03-16 Paper Packing bipartite...10 bytes (18 words) - 22:58, 11 December 2023
- Closest String Problem 2010-07-20 Paper A Linear Kernel for Co-Path/Cycle Packing 2010-07-20 Paper Randomized Approaches for Nearest Neighbor Search in...10 bytes (17 words) - 10:03, 8 December 2023
- and the odd directed cycle inequalities: Oriented graphs 2018-09-04 Paper On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free...10 bytes (16 words) - 01:47, 10 December 2023
- conditions for the existence of anti-directed Hamiltonian cycles in digraphs 2013-06-26 Paper Packing of graphic n-tuples 2012-06-04 Paper New Min-Max Theorems...10 bytes (18 words) - 21:09, 12 December 2023
- class of frame matroids 2016-12-27 Paper Packing Steiner trees 2016-04-21 Paper Stabilizer theorems for even cycle matroids 2016-03-14 Paper Graphical representations...10 bytes (16 words) - 23:39, 9 December 2023
- vertex cycle covers 2017-09-08 Paper Packing spanning graphs from separable families 2017-06-09 Paper A tight Erdős-Pósa function for long cycles 2017-05-26...10 bytes (16 words) - 12:14, 7 October 2023
- Publication Date of Publication Type Maximum cycle packing using SPR-trees 2021-08-23 Paper...10 bytes (16 words) - 23:15, 27 December 2023
- Publication Date of Publication Type Planar vertex-disjoint cycle packing: new structures and improved kernel 2018-03-26 Paper...10 bytes (16 words) - 19:22, 24 September 2023
- 2021-07-27 Paper On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs 2021-04-15 Paper Corrigendum to: ``Modeling the packing coloring problem...10 bytes (17 words) - 18:00, 9 December 2023
- de/entity/Q4595228 2017-11-29 Paper Squashing maximum packings of Kn with 8-cycles into maximum packings of Kn with 4-cycles 2017-04-11 Paper Decompositions of complete...10 bytes (16 words) - 16:16, 10 December 2023
- de/entity/Q5747404 2014-02-14 Paper Corrigendum to ``Cycle transversals in perfect graphs and cographs 2013-12-11 Paper Cycle transversals in bounded degree graphs 2013-07-19...10 bytes (17 words) - 21:56, 10 December 2023
