Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Paper Precoloring extension for 2-connected graphs with maximum degree three 2009-12-15 Paper On list critical graphs 2009-12-15 Paper Precoloring extension...
    10 bytes (17 words) - 23:52, 11 December 2023
  • of induced subgraphs in \(K_{1,r}\)-free graphs 2012-08-10 Paper Precoloring extension forK4-minor-free graphs 2009-06-16 Paper On the domination number...
    10 bytes (16 words) - 23:52, 11 December 2023
  • Publication Date of Publication Type List precoloring extension in planar graphs 2011-05-16 Paper...
    10 bytes (18 words) - 19:57, 6 October 2023
  • Publication Date of Publication Type Precoloring extension involving pairs of vertices of small distance 2014-02-18 Paper...
    10 bytes (16 words) - 10:43, 7 October 2023
  • Type Spanning trees homeomorphic to a small tree 2015-12-08 Paper Precoloring extension involving pairs of vertices of small distance 2014-02-18 Paper...
    10 bytes (16 words) - 07:27, 7 October 2023
  • method of search for solving polynomial equations 1997-12-08 Paper Precoloring Extension III: Classes of Perfect Graphs 1996-09-29 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 03:58, 12 December 2023
  • Publication Date of Publication Type Edge precoloring extension of hypercubes 2022-03-31 Paper Complex and homomorphic chromatic number of signed planar...
    10 bytes (18 words) - 09:46, 24 September 2023
  • with interval graph compatibilities between tasks 2008-03-18 Paper Precoloring extension of co-Meyniel graphs 2007-09-10 Paper Simultaneous optimization of...
    10 bytes (16 words) - 08:07, 7 October 2023
  • clustering 2013-12-19 Paper A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS 2013-07-30 Paper List factoring and relative worst...
    10 bytes (18 words) - 00:32, 25 September 2023
  • extending partial edge colorings of hypercubes 2022-04-07 Paper Edge precoloring extension of hypercubes 2022-03-31 Paper https://portal.mardi4nfdi.de/entity/Q5026976...
    10 bytes (18 words) - 22:00, 10 December 2023
  • extending partial edge colorings of hypercubes 2022-04-07 Paper Edge precoloring extension of hypercubes 2022-03-31 Paper https://portal.mardi4nfdi.de/entity/Q5018306...
    10 bytes (17 words) - 00:25, 11 December 2023
  • https://portal.mardi4nfdi.de/entity/Q3015645 2011-07-13 Paper List precoloring extension in planar graphs 2011-05-16 Paper https://portal.mardi4nfdi.de/entity/Q3656224...
    10 bytes (19 words) - 06:10, 12 December 2023
  • diversity 2008-06-05 Paper Detecting induced subgraphs 2008-06-05 Paper Precoloring extension of co-Meyniel graphs 2007-09-10 Paper Coloring Meyniel graphs in...
    10 bytes (16 words) - 09:32, 6 October 2023
  • on the monotonicity of mixed Ramsey numbers 2011-08-09 Paper List precoloring extension in planar graphs 2011-05-16 Paper On colorings avoiding a rainbow...
    10 bytes (18 words) - 17:15, 9 December 2023
  • of trees 2006-09-14 Paper Algorithms – ESA 2005 2006-06-27 Paper Precoloring extension on unit interval graphs 2006-06-09 Paper Parameterized graph separation...
    10 bytes (16 words) - 16:38, 10 December 2023
  • de/entity/Q4414498 2003-07-25 Paper NP completeness of the edge precoloring extension problem on bipartite graphs 2003-06-25 Paper https://portal.mardi4nfdi...
    10 bytes (17 words) - 22:03, 8 December 2023
  • Access Graphs 2013-08-12 Paper A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS 2013-07-30 Paper List factoring and relative worst...
    10 bytes (18 words) - 12:37, 8 December 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q5442540 2008-02-22 Paper Precoloring extension of co-Meyniel graphs 2007-09-10 Paper Coloring Meyniel graphs in...
    10 bytes (16 words) - 11:58, 9 December 2023
  • Extending precolorings to circular colorings 2006-07-12 Paper Distinguishing Cartesian powers of graphs 2005-11-01 Paper Precoloring Extensions of Brooks'...
    10 bytes (18 words) - 20:52, 8 December 2023
  • proximity and matching extension in punctured planar triangulations 2017-09-18 Paper Toughness, binding number and restricted matching extension in a graph 2017-09-05...
    10 bytes (16 words) - 00:25, 25 September 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)