Search results
From MaRDI portal
- of sparse graphs 2013-06-13 Paper A Complexity Dichotomy for the Coloring of Sparse Graphs 2013-05-21 Paper Locally identifying coloring of graphs 2012-10-24...10 bytes (16 words) - 03:03, 10 December 2023
- edge-coloring of subcubic graphs 2018-08-10 Paper List star chromatic index of sparse graphs 2018-05-24 Paper List star edge coloring of sparse graphs 2018-02-22 Paper...10 bytes (17 words) - 20:51, 8 December 2023
- F-partitions of sparse graphs 2016-06-20 Paper Ore's conjecture on color-critical graphs is almost true 2014-10-22 Paper Planar 4-critical graphs with four triangles...10 bytes (18 words) - 22:43, 10 December 2023
- List Dynamic Coloring of Sparse Graphs 2011-08-12 Paper Injective colorings of graphs with low average degree 2011-06-30 Paper Graphs having many holes but...10 bytes (18 words) - 12:10, 11 December 2023
- bounded quantifier depth of very sparse random graphs 2018-02-27 Paper Monadic second-order properties of very sparse random graphs 2017-09-19 Paper First-order...10 bytes (18 words) - 13:47, 28 January 2024
- 22 2012-09-05 Paper \((k,j)\)-coloring of sparse graphs 2012-04-30 Paper \((k,1)\)-coloring of sparse graphs 2012-04-13 Paper https://portal.mardi4nfdi.de/entity/Q3115232...10 bytes (18 words) - 21:30, 9 December 2023
- of sparse graphs 2021-06-07 Paper Semi‐random graph process 2020-06-19 Paper EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS 2020-06-09...10 bytes (17 words) - 02:23, 11 December 2023
- first-order logic of sparse random graphs 2020-04-01 Paper Existential monadic second order convergence law fails on sparse random graphs 2019-11-28 Paper...10 bytes (17 words) - 01:44, 10 December 2023
- minimally rigid graphs in \(\mathbb{R}^2\) 2023-03-22 Paper Globally Rigid Augmentation of Rigid Graphs 2022-10-27 Paper Sparse Graphs and an Augmentation...10 bytes (16 words) - 09:44, 7 October 2023
- Paper Exploring sparse graphs with advice 2022-12-08 Paper The slotted online one-sided crossing minimization problem on 2-regular graphs 2022-08-30 Paper...10 bytes (16 words) - 05:33, 7 October 2023
- Improved induced matchings in sparse graphs 2010-11-25 Paper Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs 2010-08-27 Paper Improved...10 bytes (16 words) - 12:10, 24 September 2023
- edge-coloring of subcubic graphs 2023-07-13 Paper List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs 2019-05-17 Paper List star...10 bytes (16 words) - 10:59, 7 October 2023
- degree graphs 2019-05-02 Paper Monochromatic trees in random graphs 2019-01-31 Paper Near-perfect clique-factors in sparse pseudorandom graphs 2018-10-11...10 bytes (17 words) - 14:59, 10 December 2023
- Cycles in Sparse Random Graphs 2013-01-04 Paper Pancyclic subgraphs of random graphs 2012-09-12 Paper Corrádi and Hajnal's Theorem for Sparse Random Graphs...10 bytes (17 words) - 14:59, 10 December 2023
- clustered choosability of sparse graphs 2020-04-06 Paper Covering radius in the Hamming permutation space 2019-11-28 Paper Sparse Graphs of High Gonality 2018-06-15...10 bytes (16 words) - 19:34, 24 September 2023
- problem, and its application to \(P_4\)-sparse graphs 2015-05-21 Paper On the minimum sum coloring of \(P_4\)-sparse graphs 2014-09-19 Paper On lower bounds for...10 bytes (19 words) - 08:10, 7 October 2023
- power graphs and necklaces 2023-07-07 Paper Injective edge coloring of graphs with maximum degree 5 2023-05-11 Paper Injective edge coloring of sparse graphs...10 bytes (16 words) - 13:39, 28 January 2024
- Anti-Ramsey threshold of cycles for sparse graphs 2022-04-27 Paper On edge-magic labelings of forests 2022-04-27 Paper Counting sparse \(k\)-edge-connected hypergraphs...10 bytes (19 words) - 02:23, 11 December 2023
- The strong clique index of a graph with forbidden cycles 2023-10-04 Paper Odd coloring of sparse graphs and planar graphs 2023-03-10 Paper Improvements...10 bytes (16 words) - 10:59, 6 October 2023
- planar graphs without 4-cycles 2021-03-20 Paper Sparse Graphs Are Near-Bipartite 2020-10-28 Paper A characterization of (4,2)‐choosable graphs 2020-07-17...10 bytes (18 words) - 10:52, 6 October 2023