Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Paper Properly colored spanning trees in edge-colored graphs 2019-12-12 Paper Properly colored short cycles in edge-colored graphs 2019-11-04 Paper Adjacent...
    10 bytes (17 words) - 21:34, 9 December 2023
  • double cover conjecture 2016-05-10 Paper Pairwise balanced designs and sigma clique partitions 2016-04-07 Paper Small oriented cycle double cover of graphs...
    10 bytes (16 words) - 22:20, 9 December 2023
  • of the maximum edge subgraph problem 2013-07-19 Paper On coloring problems with local constraints 2013-07-19 Paper Minimum Clique Cover in Claw-Free Perfect...
    10 bytes (18 words) - 10:11, 11 December 2023
  • Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs 2021-11-22 Paper On the minimal free resolution of symbolic powers of cover ideals of graphs...
    10 bytes (20 words) - 16:15, 11 December 2023
  • Paper Detecting robust cliques in graphs subject to uncertain edge failures 2018-06-13 Paper On maximum degree‐based ‐quasi‐clique problem: Complexity and...
    10 bytes (18 words) - 21:48, 10 December 2023
  • mardi4nfdi.de/entity/Q3014360 2011-07-19 Paper The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph 2010-06-25...
    10 bytes (17 words) - 01:26, 10 December 2023
  • graphs with fixed girth or clique number 2021-02-17 Paper Connectivity and eigenvalues of graphs with given girth or clique number 2021-02-12 Paper Maximum...
    10 bytes (17 words) - 17:51, 11 December 2023
  • of edge dominating set 2013-01-07 Paper Algorithms for dominating clique problems 2012-11-08 Paper Efficient Algorithms for the max k -vertex cover Problem...
    10 bytes (19 words) - 10:53, 9 December 2023
  • 2010-06-17 Paper Exact Algorithms for Dominating Clique Problems 2009-12-17 Paper Approximating the Max Edge-Coloring Problem 2009-12-11 Paper Efficient Approximation...
    10 bytes (16 words) - 12:40, 28 January 2024
  • regularity of edge ideal of vertex decomposable and shellable graphs 2011-07-27 Paper Weakly polymatroidal ideals with applications to vertex cover ideals 2010-11-04...
    10 bytes (16 words) - 00:09, 11 December 2023
  • Publication Type Reducing the vertex cover number via edge contractions 2023-06-12 Paper On the maximum number of edges in planar graphs of bounded degree...
    10 bytes (18 words) - 04:40, 12 December 2023
  • 2014-08-29 Paper 2-clique-bond of stable set polyhedra 2014-04-22 Paper https://portal.mardi4nfdi.de/entity/Q2861525 2013-11-08 Paper Edge-colouring of joins...
    10 bytes (16 words) - 20:50, 8 December 2023
  • weighted \(k\)-path vertex cover problem 2014-09-08 Paper Dominating sequences in graphs 2014-09-04 Paper Domination game: effect of edge- and vertex-removal...
    10 bytes (17 words) - 23:19, 8 December 2023
  • Paper Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems 2017-03-27 Paper https://portal.mardi4nfdi.de/entity/Q2969039...
    10 bytes (18 words) - 21:25, 9 December 2023
  • for Minimum Vertex Cover 2013-05-02 Paper Local search with edge weighting and configuration checking heuristics for minimum vertex cover 2011-11-17 Paper...
    10 bytes (16 words) - 15:35, 6 October 2023
  • claw-free graphs 2020-06-09 Paper Clique-Width for Graph Classes Closed under Complementation 2020-06-09 Paper Clique-Width: Harnessing the Power of Atoms...
    10 bytes (16 words) - 13:28, 8 December 2023
  • Induced Bipartite Subgraph Problem with Edge Weights 2008-08-13 Paper Chromatic characterization of biclique covers 2006-04-28 Paper A linear programming...
    10 bytes (16 words) - 04:38, 12 December 2023
  • 2021-03-24 Paper Lifting of probabilistic cover inequalities 2019-02-22 Paper Lifting and separation of robust cover inequalities 2018-10-04 Paper Dantzig-Wolfe...
    10 bytes (16 words) - 12:22, 9 December 2023
  • https://portal.mardi4nfdi.de/entity/Q6162309 2023-06-15 Paper On b-edge consecutive edge magic total labeling on trees 2022-11-29 Paper Note on in-antimagicness...
    10 bytes (18 words) - 02:05, 11 December 2023
  • Sorting by Transpositions 2011-06-17 Paper On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs 2010-08-13 Paper \(2K_{2}\) vertex-set...
    10 bytes (16 words) - 10:24, 8 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)