Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • of Publication Type The inductive graph dimension from the minimum edge clique cover 2021-11-30 Paper...
    10 bytes (16 words) - 23:09, 24 September 2023
  • of Publication Type The inductive graph dimension from the minimum edge clique cover 2021-11-30 Paper...
    10 bytes (16 words) - 23:09, 24 September 2023
  • 2018-08-16 Paper Edge clique covering sum of graphs 2018-02-22 Paper Pairwise balanced designs and sigma clique partitions 2016-04-07 Paper Local Clique Covering...
    10 bytes (16 words) - 03:09, 10 December 2023
  • triangulations parameterized by edge clique cover 2022-08-03 Paper Solving Graph Problems via Potential Maximal Cliques 2019-03-27 Paper...
    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
  • two classes of 2-connected non-Hamiltonian graphs 2022-05-17 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 2023-09-29 Paper A lower bound on the size of an absorbing...
    10 bytes (16 words) - 14:54, 9 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:07, 12 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
  • system for duplicate bridge 2007-03-09 Paper Sphericity, cubicity, and edge clique covers of graphs 2006-06-30 Paper Optimal strategies for node selection games...
    10 bytes (17 words) - 16:07, 8 December 2023
  • 2023-10-12 Paper Edge clique covers in graphs with independence number two 2023-09-29 Paper EPTAS and Subexponential Algorithm for Maximum Clique on Disk and...
    10 bytes (16 words) - 23:52, 11 December 2023
  • Publication Date of Publication Type Edge clique covers in graphs with independence number two 2023-09-29 Paper Further results on Hendry's Conjecture...
    10 bytes (16 words) - 13:42, 28 January 2024
  • 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
  • and Approximate Shortest Unique Substring Queries 2016-01-11 Paper Edge-clique covers of the tensor product 2015-12-08 Paper $$Top$$ - $$K$$ Query Retrieval...
    10 bytes (19 words) - 03:46, 25 September 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
  • for cluster vertex deletion 2016-03-09 Paper Known Algorithms for Edge Clique Cover are Probably Optimal 2016-01-20 Paper Fixed-Parameter Tractability...
    10 bytes (18 words) - 09:05, 7 October 2023
  • Transitive Graphs 2015-05-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
  • Paper Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem 2023-10-04 Paper Edge clique covers in graphs with independence number...
    10 bytes (16 words) - 22:21, 24 September 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)