Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • dimension from the minimum edge clique cover 2021-11-30 Paper The Inductive Graph Dimension from The Minimum Edge Clique Cover 2019-03-06 Paper...
    10 bytes (16 words) - 23:09, 24 September 2023
  • dimension from the minimum edge clique cover 2021-11-30 Paper The Inductive Graph Dimension from The Minimum Edge Clique Cover 2019-03-06 Paper...
    10 bytes (16 words) - 23:09, 24 September 2023
  • Paper The spectrum for large sets of ‐GDDs of type 2019-03-28 Paper Edge clique cover of claw‐free graphs 2019-03-28 Paper On a Question of Erdös and Faudree...
    10 bytes (16 words) - 03:09, 10 December 2023
  • triangulations parameterized by edge clique cover 2022-08-03 Paper Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover 2020-11-23 Paper Solving...
    10 bytes (16 words) - 01:04, 25 September 2023
  • partial-terminal Steiner tree problem with edge cost 1 or 2 2015-11-17 Paper On the complete width and edge clique cover problems 2015-10-29 Paper Characterizing...
    10 bytes (18 words) - 14:52, 6 October 2023
  • Three-path-configurations and logarithmic treewidth 2021-09-03 Paper Edge clique cover of claw‐free graphs 2019-03-28 Paper...
    10 bytes (16 words) - 01:37, 25 September 2023
  • recognition of 4-leaf powers 2018-11-05 Paper On the complete width and edge clique cover problems 2018-07-20 Paper https://portal.mardi4nfdi.de/entity/Q4636534...
    10 bytes (19 words) - 20:13, 8 December 2023
  • Paper Bounds on graph spectra 1984-01-01 Paper Upper bounds on the edge clique cover number of a graph 1984-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3695292...
    10 bytes (18 words) - 14:08, 12 December 2023
  • Publication Date of Publication Type Edge Clique Covers in Graphs with Independence Number Two: a Special Case 2021-12-07 Paper The Mahler measure of a...
    10 bytes (16 words) - 13:48, 28 January 2024
  • Publication Date of Publication Type Edge clique covers in graphs with independence number two 2023-09-29 Paper Siblings of countable cographs 2020-04-26...
    10 bytes (16 words) - 14:54, 9 December 2023
  • Related Problems on Some Classes of Perfect Graphs 2016-04-01 Paper Edge-clique covers of the tensor product 2015-12-08 Paper On maximum independent set...
    10 bytes (18 words) - 07:27, 7 October 2023
  • Algorithms for Edge Clique Cover are Probably Optimal 2016-01-20 Paper On Multiway Cut Parameterized above Lower Bounds 2015-09-24 Paper Clique Cover and Graph...
    10 bytes (17 words) - 09:05, 7 October 2023
  • Paper Bounds on graph spectra 1984-01-01 Paper Upper bounds on the edge clique cover number of a graph 1984-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3695292...
    10 bytes (18 words) - 14:07, 12 December 2023
  • Caterpillars in Erdős-Hajnal 2019-06-17 Paper Known Algorithms for Edge Clique Cover are Probably Optimal 2019-05-15 Paper Minimum Bisection Is Fixed-Parameter...
    10 bytes (18 words) - 09:05, 7 October 2023
  • fixed-parameter tractability 2019-05-15 Paper Known Algorithms for Edge Clique Cover are Probably Optimal 2019-05-15 Paper Minimum Bisection Is Fixed-Parameter...
    10 bytes (17 words) - 02:52, 7 October 2023
  • Packing Boxes with Bricks 2006-07-12 Paper Sphericity, cubicity, and edge clique covers of graphs 2006-06-30 Paper Ryser's embedding problem for Hadamard...
    10 bytes (18 words) - 02:53, 7 October 2023
  • planar graphs 2015-02-21 Paper Clique Cover Width and Clique Sum 2014-04-02 Paper Unit Incomparability Dimension and Clique Cover Width in Graphs 2014-01-03...
    10 bytes (16 words) - 17:14, 7 December 2023
  • Decompositions for edge-coloring join graphs and cobipartite graphs 2010-08-13 Paper On maximizing clique, clique-Helly and hereditary clique-Helly induced...
    10 bytes (22 words) - 10:24, 8 December 2023
  • distance-hereditary graphs 2013-01-18 Paper Independent sets in edge-clique graphs 2012-06-10 Paper Edge-clique graphs of cocktail parties have unbounded rankwidth...
    10 bytes (19 words) - 21:31, 8 December 2023
  • Parameterized Power Vertex Cover 2018-12-10 Paper Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs 2018-08-17...
    10 bytes (16 words) - 12:40, 28 January 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)