UB Paderborn / Katalog / Suche / in CDI

Kempe Equivalent List Colorings

Combinatorica (Budapest. 1981), 2024-02, Vol.44 (1), p.125-153

2024

Link zum Volltext

Verfügbarkeit prüfen

5‐Coloring reconfiguration of planar graphs with no short odd cycles

Journal of graph theory, 2024-04, Vol.105 (4), p.670-679

2024

Link zum Volltext

Verfügbarkeit prüfen

A characterization of (4,2)‐choosable graphs

Journal of graph theory, 2019-12, Vol.92 (4), p.460-487

Cranston, Daniel W.

2019

Link zum Volltext

Verfügbarkeit prüfen

Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ −1 ${\rm{\Delta }}-1$ colors

Journal of graph theory, 2022-12, Vol.101 (4), p.633-642

2022

Link zum Volltext

Verfügbarkeit prüfen

Brooks' Theorem and Beyond

Journal of graph theory, 2015-11, Vol.80 (3), p.199-225

2015

Link zum Volltext

Verfügbarkeit prüfen

Regular Graphs of Odd Degree Are Antimagic

Journal of graph theory, 2015-09, Vol.80 (1), p.28-33

2015

Link zum Volltext

Verfügbarkeit prüfen

The fractional chromatic number of the plane

Combinatorica (Budapest. 1981), 2017-10, Vol.37 (5), p.837-861

2017

Link zum Volltext

Verfügbarkeit prüfen

Edge Lower Bounds for List Critical Graphs, Via Discharging

Combinatorica (Budapest. 1981), 2018-10, Vol.38 (5), p.1045-1065

2018

Link zum Volltext

Verfügbarkeit prüfen

List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles

Journal of graph theory, 2017-08, Vol.85 (4), p.721-737

2017

Link zum Volltext

Verfügbarkeit prüfen

Subcubic Edge‐Chromatic Critical Graphs Have Many Edges

Journal of graph theory, 2017-09, Vol.86 (1), p.122-136

2017

Link zum Volltext

Verfügbarkeit prüfen

Strong edge-coloring of graphs with maximum degree 4 using 22 colors

Discrete mathematics, 2006-11, Vol.306 (21), p.2772-2778

Cranston, Daniel W.

2006

Link zum Volltext

Verfügbarkeit prüfen

Coloring Claw-Free Graphs with $\Delta-1$ Colors

SIAM journal on discrete mathematics, 2013-01, Vol.27 (1), p.534-549

2013

Link zum Volltext

Verfügbarkeit prüfen

Modified linear programming and class 0 bounds for graph pebbling

Journal of combinatorial optimization, 2017-07, Vol.34 (1), p.114-132

2017

Link zum Volltext

Verfügbarkeit prüfen

Kempe equivalent list edge-colorings of planar graphs

Discrete mathematics, 2023-11, Vol.346 (11), p.113180, Article 113180

Cranston, Daniel W.

2023

Link zum Volltext

Verfügbarkeit prüfen

Odd-sum colorings of planar graphs

Discrete Applied Mathematics, 2024-01, Vol.342, p.82-88

Cranston, Daniel W.

2024

Link zum Volltext

Verfügbarkeit prüfen

Hamiltonicity in connected regular graphs

Information processing letters, 2013-11, Vol.113 (22-24), p.858-860

2013

Link zum Volltext

Verfügbarkeit prüfen

Strong edge-coloring of cubic bipartite graphs: A counterexample

Discrete Applied Mathematics, 2022-11, Vol.321, p.258-260

Cranston, Daniel W.

2022

Link zum Volltext

Verfügbarkeit prüfen

Bounding clique size in squares of planar graphs

European journal of combinatorics, 2024-08, Vol.120, p.103960, Article 103960

Cranston, Daniel W.

2024

Link zum Volltext

Verfügbarkeit prüfen

Kempe classes and almost bipartite graphs

Discrete Applied Mathematics, 2024-11, Vol.357, p.94-98

2024

Link zum Volltext

Verfügbarkeit prüfen

Game matching number of graphs

Discrete Applied Mathematics, 2013-09, Vol.161 (13-14), p.1828-1836

2013

Link zum Volltext

Verfügbarkeit prüfen

List-recoloring of sparse graphs

European journal of combinatorics, 2022-10, Vol.105, p.103562, Article 103562

Cranston, Daniel W.

2022

Link zum Volltext

Verfügbarkeit prüfen

Injective colorings of sparse graphs

Discrete mathematics, 2010-11, Vol.310 (21), p.2965-2973

2010

Link zum Volltext

Verfügbarkeit prüfen

Cliques in squares of graphs with maximum average degree less than 4

Journal of graph theory, 2024-07

2024

Link zum Volltext

Verfügbarkeit prüfen

Linear choosability of sparse graphs

Discrete mathematics, 2011-09, Vol.311 (17), p.1910-1917

2011

Link zum Volltext

Verfügbarkeit prüfen

An introduction to the discharging method via graph coloring

Discrete mathematics, 2017-04, Vol.340 (4), p.766-793

2017

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

Kempe Equivalent List Colorings

5‐Coloring reconfiguration of planar graphs with no short odd cycles

A characterization of (4,2)‐choosable graphs

Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ −1 ${\rm{\Delta }}-1$ colors

Brooks' Theorem and Beyond

Regular Graphs of Odd Degree Are Antimagic

The fractional chromatic number of the plane

Edge Lower Bounds for List Critical Graphs, Via Discharging

List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles

Subcubic Edge‐Chromatic Critical Graphs Have Many Edges

Strong edge-coloring of graphs with maximum degree 4 using 22 colors

Coloring Claw-Free Graphs with $\Delta-1$ Colors

Modified linear programming and class 0 bounds for graph pebbling

Kempe equivalent list edge-colorings of planar graphs

Odd-sum colorings of planar graphs

Hamiltonicity in connected regular graphs

Strong edge-coloring of cubic bipartite graphs: A counterexample

Bounding clique size in squares of planar graphs

Kempe classes and almost bipartite graphs

Game matching number of graphs

List-recoloring of sparse graphs

Injective colorings of sparse graphs

Cliques in squares of graphs with maximum average degree less than 4

Linear choosability of sparse graphs

An introduction to the discharging method via graph coloring

Suchergebnisse filtern