UB Paderborn / Katalog / Suche / in CDI

Open Locating-Dominating Sets in Circulant Graphs

Discussiones Mathematicae. Graph Theory, 2022-02, Vol.42 (1), p.47-62

2022

Volltextzugriff (PDF)

Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks

IEEE/ACM transactions on networking, 2014-06, Vol.22 (3), p.889-902

2014

Volltextzugriff (PDF)

Strong edge-coloring of 2-degenerate graphs

Discrete Applied Mathematics, 2023-09, Vol.336, p.11-14

2023

Volltextzugriff (PDF)

Covering 2‐connected 3‐regular graphs with disjoint paths

Journal of graph theory, 2018-07, Vol.88 (3), p.385-401

Yu, Gexin

2018

Volltextzugriff (PDF)

Partition graphs of independence number 2 into two subgraphs with large chromatic numbers

Discrete mathematics, 2022-04, Vol.345 (4), p.112781, Article 112781

2022

Volltextzugriff (PDF)

Planar graphs without short even cycles are near-bipartite

Discrete Applied Mathematics, 2020-09, Vol.284, p.626-630

2020

Volltextzugriff (PDF)

Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs

Journal of graph theory, 2022-09, Vol.101 (1), p.134-141

2022

Volltextzugriff (PDF)

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

Journal of graph theory, 2024-07

2024

Volltextzugriff (PDF)

Injective colorings of sparse graphs

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

2010

Volltextzugriff (PDF)

On the irregularity of uniform hypergraphs

Linear algebra and its applications, 2023-12, Vol.678, p.107-124

2023

Volltextzugriff (PDF)

Maximum average degree and relaxed coloring

Discrete mathematics, 2017-10, Vol.340 (10), p.2528-2530

2017

Volltextzugriff (PDF)

Note on injective edge-coloring of graphs

Discrete Applied Mathematics, 2022-03, Vol.310, p.65-74

2022

Volltextzugriff (PDF)

1-planar graphs are odd 13-colorable

Discrete mathematics, 2023-08, Vol.346 (8), p.113423, Article 113423

2023

Volltextzugriff (PDF)

Linear choosability of sparse graphs

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

2011

Volltextzugriff (PDF)

Strong edge-colorings for k-degenerate graphs

Graphs and combinatorics, 2015-09, Vol.31 (5), p.1815-1818

Yu, Gexin

2015

Volltextzugriff (PDF)

Optimal connectivity for fat-triangle linkages

Discrete mathematics, 2023-05, Vol.346 (5), p.113319, Article 113319

2023

Volltextzugriff (PDF)

Spanning tree packing and 2-essential edge-connectivity

Discrete mathematics, 2023-01, Vol.346 (1), p.113132, Article 113132

2023

Volltextzugriff (PDF)

Planar graphs without 4-cycles and intersecting triangles are (1,1,0)-colorable

Discrete Applied Mathematics, 2021-12, Vol.304, p.236-247

2021

Volltextzugriff (PDF)

DP-3-coloring of some planar graphs

Discrete mathematics, 2019-01, Vol.342 (1), p.178-189

2019

Volltextzugriff (PDF)

Hamiltonian connectedness in 3-connected line graphs

Discrete Applied Mathematics, 2009-03, Vol.157 (5), p.982-990

2009

Volltextzugriff (PDF)

Strong Chromatic Index of Graphs With Maximum Degree Four

The Electronic journal of combinatorics, 2018-08, Vol.25 (3)

2018

Volltextzugriff (PDF)

Planar graphs with girth at least 5 are (3,4)-colorable

Discrete mathematics, 2019-12, Vol.342 (12), p.111577, Article 111577

2019

Volltextzugriff (PDF)

DP-4-colorability of planar graphs without adjacent cycles of given length

Discrete Applied Mathematics, 2020-04, Vol.277, p.245-251

2020

Volltextzugriff (PDF)

Nowhere-zero Z3-flows through Z3-connectivity

Discrete mathematics, 2006-01, Vol.306 (1), p.26-30

2006

Volltextzugriff (PDF)

Strong edge-colorings for $$k$$ k -degenerate graphs

Graphs and combinatorics, 2015-09, Vol.31 (5), p.1815-1818

Yu, Gexin

2015

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Open Locating-Dominating Sets in Circulant Graphs

Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks

Strong edge-coloring of 2-degenerate graphs

Covering 2‐connected 3‐regular graphs with disjoint paths

Partition graphs of independence number 2 into two subgraphs with large chromatic numbers

Planar graphs without short even cycles are near-bipartite

Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs

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

Injective colorings of sparse graphs

On the irregularity of uniform hypergraphs

Maximum average degree and relaxed coloring

Note on injective edge-coloring of graphs

1-planar graphs are odd 13-colorable

Linear choosability of sparse graphs

Strong edge-colorings for k-degenerate graphs

Optimal connectivity for fat-triangle linkages

Spanning tree packing and 2-essential edge-connectivity

Planar graphs without 4-cycles and intersecting triangles are (1,1,0)-colorable

DP-3-coloring of some planar graphs

Hamiltonian connectedness in 3-connected line graphs

Strong Chromatic Index of Graphs With Maximum Degree Four

Planar graphs with girth at least 5 are (3,4)-colorable

DP-4-colorability of planar graphs without adjacent cycles of given length

Nowhere-zero Z3-flows through Z3-connectivity

Strong edge-colorings for $$k$$ k -degenerate graphs

Suchergebnisse filtern