Search results
From MaRDI portal
- identifiers, and fractional graph colouring 2015-12-10 Paper Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring 2012-09-26 Paper...10 bytes (16 words) - 08:36, 7 October 2023
- Publication Date of Publication Type Guide to Graph Colouring 2021-08-25 Paper A Guide to Graph Colouring 2015-11-06 Paper...10 bytes (20 words) - 19:34, 26 December 2023
- Publication Date of Publication Type Improving graph colouring algorithms and heuristics using a novel representation 2018-04-12 Paper Contraction-Based...10 bytes (16 words) - 19:17, 24 September 2023
- Size of the Giant Component of a Random Graph with a Given Degree Sequence 1999-07-19 Paper Colouring a graph frugally 1999-03-14 Paper Total Coloring...10 bytes (21 words) - 03:25, 9 December 2023
- 2024-01-09 Paper Disproving the normal graph conjecture 2021-02-03 Paper Revisiting a theorem by Folkman on graph colouring 2020-03-30 Paper Polynomial cases...10 bytes (16 words) - 10:43, 6 October 2023
- clique-colouring and biclique-colouring unichord-free graphs 2017-04-12 Paper On star and biclique edge-colorings 2017-03-16 Paper Linear-time graph distance...10 bytes (20 words) - 10:11, 11 December 2023
- Edge Coloring of Split Graphs 2008-06-05 Paper Colouring clique-hypergraphs of circulant graphs 2008-06-05 Paper The P4-sparse Graph Sandwich Problem 2007-05-29...10 bytes (20 words) - 22:07, 10 December 2023
- Paper Colouring game and generalized colouring game on graphs with cut-vertices 2011-05-09 Paper The complexity of some acyclic improper colourings 2011-05-06...10 bytes (16 words) - 22:21, 10 December 2023
- Biclique-colouring verification complexity and biclique-colouring power graphs 2015-08-18 Paper Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal...10 bytes (20 words) - 13:34, 28 January 2024
- clique-colouring and biclique-colouring unichord-free graphs 2017-04-12 Paper Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect...10 bytes (20 words) - 04:08, 12 December 2023
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs 2017-04-12 Paper Linear-time graph distance and diameter approximation...10 bytes (22 words) - 10:24, 8 December 2023
- Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph 2014-04-10 Paper Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear...10 bytes (19 words) - 03:26, 9 December 2023
- harmonious colouring for trees 1995-04-10 Paper New upper bounds on harmonious colorings 1994-09-15 Paper The complexity of some graph colouring problems...10 bytes (18 words) - 17:21, 11 December 2023
- Publication Date of Publication Type Improving graph colouring algorithms and heuristics using a novel representation 2018-04-12 Paper Application of a...10 bytes (21 words) - 20:05, 11 December 2023
- Paper Note on robust critical graphs with large odd girth 2010-03-29 Paper On the complexity of \(H\)-colouring planar graphs 2009-12-15 Paper A combinatorial...10 bytes (18 words) - 02:43, 11 December 2023
- a smallest odd hole in a claw-free graph using global structure 2014-04-10 Paper Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear...10 bytes (18 words) - 01:01, 10 December 2023
- Claw-free Graphs 2019-02-21 Paper Additive Bases and Flows in Graphs 2018-02-22 Paper Additive bases and flows in graphs 2018-01-18 Paper Colouring squares...10 bytes (22 words) - 03:16, 12 December 2023
- 2014-09-26 Paper Colouring of graphs with Ramsey-type forbidden subgraphs 2014-01-24 Paper Colouring of Graphs with Ramsey-Type Forbidden Subgraphs 2013-12-06...10 bytes (18 words) - 02:07, 11 December 2023
- 1973-01-01 Paper https://portal.mardi4nfdi.de/entity/Q5615945 1971-01-01 Paper Colouring the edges of a multigraph 1970-01-01 Paper...10 bytes (16 words) - 10:08, 12 December 2023
- Paper Edge-colouring of regular graphs of large degree 2008-01-07 Paper Improved approximation of maximum vertex cover 2006-01-18 Paper Graph-Theoretic...10 bytes (16 words) - 20:50, 8 December 2023