Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • with Larger Dilworth Number than Sperner Number 2002-05-14 Paper https://portal.mardi4nfdi.de/entity/Q4517586 2001-06-21 Paper The dilworth number of group...
    10 bytes (18 words) - 09:18, 12 December 2023
  • The Dilworth Number of a Graph 1978-01-01 Paper https://portal.mardi4nfdi.de/entity/Q4200113 1978-01-01 Paper Split Graphs Having Dilworth Number Two 1977-01-01...
    10 bytes (16 words) - 08:19, 13 December 2023
  • compatibility graphs having Dilworth number \(k\) 2014-07-25 Paper \(L(2,1)\)-labeling of oriented planar graphs 2014-04-16 Paper On Dilworth k Graphs and Their...
    10 bytes (17 words) - 03:06, 9 December 2023
  • 2015-04-29 Paper On pairwise compatibility graphs having Dilworth number \(k\) 2014-07-25 Paper On Dilworth k Graphs and Their Pairwise Compatibility 2014-02-18...
    10 bytes (16 words) - 00:32, 10 December 2023
  • https://portal.mardi4nfdi.de/entity/Q5290317 2006-04-28 Paper A bound for the Dilworth number 1990-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3492929 1990-01-01...
    10 bytes (18 words) - 13:46, 12 December 2023
  • clique covering number 2004-05-18 Paper https://portal.mardi4nfdi.de/entity/Q4803025 2003-04-23 Paper A bound for the Dilworth number 1990-01-01 Paper...
    10 bytes (18 words) - 23:53, 12 December 2023
  • Publication Date of Publication Type The Dilworth lattice of Artinian rings 2010-02-19 Paper The dilworth number and rees number of one-dimensional modules 1998-03-10...
    10 bytes (16 words) - 11:47, 6 October 2023
  • Publication Date of Publication Type The upper bound of the Dilworth number and the Rees number of Noetherian local rings with a Hilbert function 1997-06-01...
    10 bytes (16 words) - 10:51, 24 September 2023
  • de/entity/Q5290608 2006-04-28 Paper A Gorenstein Ring with Larger Dilworth Number than Sperner Number 2002-05-14 Paper GENERATING IDEALS IN COMMUTATIVE ARTINIAN...
    10 bytes (18 words) - 13:49, 7 October 2023
  • characterizations of triangulated graphs 1990-01-01 Paper Split graphs of Dilworth number 2 1985-01-01 Paper Boolean techniques for matroidal decomposition of...
    10 bytes (17 words) - 03:51, 23 September 2023
  • Recognition algorithms for orders of small width and graphs of small Dilworth number 2005-04-07 Paper https://portal.mardi4nfdi.de/entity/Q4817030 2004-09-14...
    10 bytes (17 words) - 03:51, 9 December 2023
  • Type https://portal.mardi4nfdi.de/entity/Q4514217 2001-03-11 Paper The dilworth number of group rings over an artin local ring 2001-02-27 Paper On the prime...
    10 bytes (18 words) - 10:01, 6 October 2023
  • parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU 2023-10-24 Paper On data reduction for dynamic...
    10 bytes (18 words) - 02:07, 25 September 2023
  • parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU 2023-10-24 Paper On data reduction for dynamic...
    10 bytes (18 words) - 03:38, 12 December 2023
  • https://portal.mardi4nfdi.de/entity/Q4253837 2000-07-19 Paper Jump number of dags having Dilworth number 2 1984-01-01 Paper Partitive hypergraphs 1981-01-01 Paper...
    10 bytes (16 words) - 00:03, 13 December 2023
  • Paper Stability in CAN-free graphs 1985-01-01 Paper Split graphs of Dilworth number 2 1985-01-01 Paper Boolean techniques for matroidal decomposition of...
    10 bytes (19 words) - 00:13, 9 December 2023
  • threshold and chain graphs 2019-10-09 Paper Cographs: eigenvalues and Dilworth number 2019-08-12 Paper Spectral properties of cographs andP5-free graphs 2019-07-03...
    10 bytes (16 words) - 15:25, 11 December 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q4517583 2001-03-11 Paper The dilworth number of group rings over an artin local ring 2001-02-27 Paper https://portal...
    10 bytes (18 words) - 23:11, 10 December 2023
  • Paper Stability in CAN-free graphs 1985-01-01 Paper Split graphs of Dilworth number 2 1985-01-01 Paper The struction of a graph: Application to CN-free...
    10 bytes (18 words) - 12:32, 9 December 2023
  • 1984-01-01 Paper On linear k-arboricity 1984-01-01 Paper Jump number of dags having Dilworth number 2 1984-01-01 Paper La k-Arboricité Linéaire Des Arbres 1983-01-01...
    10 bytes (18 words) - 19:55, 8 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)