Search results
From MaRDI portal
- dissatisfaction on preference graphs 2023-03-31 Paper Strong cliques in diamond-free graphs 2022-12-21 Paper Strong cliques in diamond-free graphs 2021-02-03 Paper https://portal...10 bytes (16 words) - 19:06, 13 December 2023
- 2023-09-20 Paper Strong edge coloring of circle graphs 2022-04-07 Paper Fractional meanings of nonrepetitiveness 2022-04-01 Paper $t$-Strong Cliques and the Degree-Diameter...10 bytes (16 words) - 02:06, 11 December 2023
- planar graphs into graphs with degree restrictions 2023-10-05 Paper The strong clique index of a graph with forbidden cycles 2023-10-04 Paper Odd coloring...10 bytes (18 words) - 23:09, 24 September 2023
- Publication Type Strong edge coloring of circle graphs 2022-04-07 Paper $t$-Strong Cliques and the Degree-Diameter Problem 2022-01-07 Paper Strong cliques in claw-free...10 bytes (18 words) - 09:19, 7 October 2023
- 2023-10-05 Paper The list linear arboricity of graphs 2023-10-04 Paper The strong clique index of a graph with forbidden cycles 2023-10-04 Paper Obstructions...10 bytes (16 words) - 18:15, 6 October 2023
- Publication Date of Publication Type Strong cliques in diamond-free graphs 2022-12-21 Paper Sufficient conditions for a digraph to admit a \((1, \leq \ell...10 bytes (18 words) - 23:42, 24 September 2023
- 2022-12-21 Paper Strong cliques in diamond-free graphs 2022-12-21 Paper Fair Packing of Independent Sets 2022-10-13 Paper Strong cliques in diamond-free...10 bytes (16 words) - 05:50, 7 October 2023
- Three local actions in 6‐valent arc‐transitive graphs 2023-10-04 Paper Strong cliques in vertex‐transitive graphs 2023-08-22 Paper On some problems regarding...10 bytes (17 words) - 13:44, 28 January 2024
- planar graphs into graphs with degree restrictions 2023-10-05 Paper The strong clique index of a graph with forbidden cycles 2023-10-04 Paper Odd coloring...10 bytes (16 words) - 10:59, 6 October 2023
- versus clique number in graph classes with a forbidden structure 2022-12-21 Paper Edge elimination and weighted graph classes 2022-12-21 Paper Strong cliques...10 bytes (17 words) - 03:18, 7 October 2023
- Paper Variations on the Petersen colouring conjecture 2020-01-17 Paper Strong cliques and forbidden cycles 2020-01-17 Paper Distance Colouring Without One...10 bytes (16 words) - 18:33, 24 September 2023
- Paper Bipartite induced density in triangle-free graphs 2020-06-04 Paper Strong cliques and forbidden cycles 2020-01-17 Paper A tight Erdős-Pósa function for...10 bytes (20 words) - 18:33, 24 September 2023
- iterated clique graphs that are also third iterated clique graphs 2016-10-17 Paper On self-clique shoal graphs 2016-04-07 Paper On self-clique graphs with...10 bytes (18 words) - 01:27, 10 December 2023
- 2019-12-18 Paper On strong graph bundles 2017-09-18 Paper On self-clique shoal graphs 2016-04-07 Paper On self-clique graphs with triangular cliques 2015-12-08...10 bytes (18 words) - 15:39, 8 December 2023
- Graphs, Retractions and Clique Graphs 2008-06-05 Paper On hereditary clique-Helly self-clique graphs 2008-04-16 Paper Posets, clique graphs and their homotopy...10 bytes (16 words) - 01:27, 10 December 2023
- maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs 2008-06-05 Paper On the complexity of the sandwich problems for strongly chordal...10 bytes (16 words) - 10:24, 8 December 2023
- https://portal.mardi4nfdi.de/entity/Q5136240 2020-11-25 Paper Between clique-width and linear clique-width of bipartite graphs 2020-06-08 Paper An optimal XP algorithm...10 bytes (18 words) - 11:54, 11 December 2023
- case 2017-07-26 Paper Colouring perfect graphs with bounded clique number 2016-11-25 Paper Clique-stable set separation in perfect graphs with no balanced...10 bytes (16 words) - 00:27, 10 December 2023
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms 2021-10-04 Paper Maximal strongly connected cliques in directed graphs: algorithms...10 bytes (16 words) - 22:17, 24 September 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
