Gexin Yu

Rachel Yu

Discret. Appl. Math., September, 2023

1-planar graphs are odd 13-colorable.

[BibT_eX]

[DOI]

Weifan Wang

Discret. Math., August, 2023

Optimal connectivity for fat-triangle linkages.

[BibT_eX]

[DOI]

Martin Rolek

Discret. Math., May, 2023

Spanning tree packing and 2-essential edge-connectivity.

[BibT_eX]

[DOI]

Xiaofeng Gu

Discret. Math., 2023

2022

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

[BibT_eX]

[DOI]

Yue Wang

J. Graph Theory, 2022

Open locating-dominating sets in circulant graphs.

[BibT_eX]

[DOI]

Robin M. Givens

Rex K. Kincaid

Discuss. Math. Graph Theory, 2022

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

[BibT_eX]

[DOI]

Yue Wang

Discret. Math., 2022

Note on injective edge-coloring of graphs.

[BibT_eX]

[DOI]

Zhengke Miao

Yimin Song

Discret. Appl. Math., 2022

2021

Connectivity for Kite-Linked Graphs.

[BibT_eX]

[DOI]

Martin Rolek

D. Christopher Stephens

Dong Ye

SIAM J. Discret. Math., 2021

Sufficient Conditions for 2-Dimensional Global Rigidity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

An improved linear connectivity bound for tournaments to be highly linked.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable.

[BibT_eX]

[DOI]

Yuxue Yin

Discret. Math., 2020

Planar graphs without 7-cycles and butterflies are DP-4-colorable.

[BibT_eX]

[DOI]

Seog-Jin Kim

Discret. Math., 2020

The strong edge-coloring for graphs with small edge weight.

[BibT_eX]

[DOI]

Discret. Math., 2020

Planar graphs without short even cycles are near-bipartite.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Packing (1, 1, 2, 2)-coloring of some subcubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Recent progress on strong edge-coloring of graphs.

[BibT_eX]

[DOI]

Kecai Deng

Xiangqian Zhou

Discret. Math. Algorithms Appl., 2019

Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable.

[BibT_eX]

[DOI]

Yuxue Yin

Discret. Math., 2019

Minimum degree condition for a graph to be knitted.

[BibT_eX]

[DOI]

Martin Rolek

Discret. Math., 2019

DP-3-coloring of some planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Ilkyoo Choi

Xia Zhang

Discret. Math., 2019

DP-4-colorability of two classes of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

Strong edge-coloring for planar graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

Covering 2-connected 3-regular graphs with disjoint paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

A relaxation of the strong Bordeaux Conjecture.

[BibT_eX]

[DOI]

Ziwen Huang

J. Graph Theory, 2018

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable.

[BibT_eX]

[DOI]

Heather Hoskins

Jennifer Vandenbussche

J. Comb. Optim., 2018

Strong list-chromatic index of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

On strong edge-coloring of graphs with maximum degree 4.

[BibT_eX]

[DOI]

Jian-Bo Lv

Discret. Appl. Math., 2018

Strong Chromatic Index of Graphs With Maximum Degree Four.

[BibT_eX]

[DOI]

Mingfang Huang

Michael Santana

Electron. J. Comb., 2018

An integer linear program for mixed-weight open locating-dominating sets.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

2017

Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable.

[BibT_eX]

[DOI]

Ying Bai

J. Comb. Optim., 2017

Maximum average degree and relaxed coloring.

[BibT_eX]

[DOI]

Michael Kopreski

Discret. Math., 2017

The strong chromatic index of (3, Δ)-bipartite graphs.

[BibT_eX]

[DOI]

Mingfang Huang

Xiangqian Zhou

Discret. Math., 2017

A Note on Chromatic Number and Induced Odd Cycles.

[BibT_eX]

[DOI]

Baogang Xu

Xiaoya Zha

Electron. J. Comb., 2017

Mixed-weight open locating-dominating sets.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2016

A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

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

[BibT_eX]

[DOI]

Discret. Math., 2016

Extremal Permutations in Routing Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Strong edge-colorings for k-degenerate graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

A relaxation of the Bordeaux Conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Optimal open-locating-dominating sets in infinite triangular grids.

[BibT_eX]

[DOI]

Rex K. Kincaid

Allison Oldham

Discret. Appl. Math., 2015

2014

Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A Relaxation of Steinberg's Conjecture.

[BibT_eX]

[DOI]

Owen Hill

SIAM J. Discret. Math., 2013

Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

J. Comb. Theory B, 2013

Linear colorings of subcubic graphs.

[BibT_eX]

[DOI]

Chun-Hung Liu

Eur. J. Comb., 2013

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable.

[BibT_eX]

[DOI]

Discret. Math., 2013

New bounds on the minimum density of an identifying code for the infinite hexagonal grid.

[BibT_eX]

[DOI]

Ari Cukierman

Discret. Appl. Math., 2013

2012

Linkage for the diamond and the path with four vertices.

[BibT_eX]

[DOI]

Mark N. Ellingham

Michael D. Plummer

J. Graph Theory, 2012

Graphs Containing Every 2-Factor.

[BibT_eX]

[DOI]

Graphs Comb., 2012

An extremal problem on group connectivity of graphs.

[BibT_eX]

[DOI]

Rong Luo

Rui Xu

Eur. J. Comb., 2012

Equitable defective coloring of sparse planar graphs.

[BibT_eX]

[DOI]

Lee Williams

Jennifer Vandenbussche

Discret. Math., 2012

2011

Permutations as Product of Parallel Transpositions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Linear choosability of sparse graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Injective Colorings of Graphs with Low Average Degree.

[BibT_eX]

[DOI]

Seog-Jin Kim

Algorithmica, 2011

ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Equitable Coloring of Sparse Planar Graphs.

[BibT_eX]

[DOI]

Rong Luo

Jean-Sébastien Sereni

D. Christopher Stephens

SIAM J. Discret. Math., 2010

Injective colorings of sparse graphs.

[BibT_eX]

[DOI]

Seog-Jin Kim

Discret. Math., 2010

2009

On the Pagenumber of k-Trees.

[BibT_eX]

[DOI]

Jennifer Vandenbussche

Douglas B. West

SIAM J. Discret. Math., 2009

Implications among linkage properties in graphs.

[BibT_eX]

[DOI]

Qi Liu

Douglas B. West

J. Graph Theory, 2009

M-degrees of quadrangle-free planar graphs.

[BibT_eX]

[DOI]

Oleg V. Borodin

Naeem N. Sheikh

J. Graph Theory, 2009

Ore-type conditions implying 2-factors consisting of short cycles.

[BibT_eX]

[DOI]

Discret. Math., 2009

Hamiltonian connectedness in 3-connected line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

On the First-Fit Chromatic Number of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Ore-type degree conditions for a graph to be H-linked.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Packing of graphs with small product of sizes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Ore-condition and Z3-connectivity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Decomposing a planar graph with girth 9 into a forest and a matching.

[BibT_eX]

[DOI]

Oleg V. Borodin

Naeem N. Sheikh

Eur. J. Comb., 2008

Minimum degree conditions for H-linked graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On a graph packing conjecture by Bollobás, Eldridge and Catlin.

[BibT_eX]

[DOI]

Hemanshu Kaul

Comb., 2008

2007

An Ore-type analogue of the Sauer-Spencer Theorem.

[BibT_eX]

[DOI]

Graphs Comb., 2007

An inequality for the group chromatic number of a graph.

[BibT_eX]

[DOI]

Hong-Jian Lai

Discret. Math., 2007

Ore-type graph packing problems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2006

On Minimum Degree Implying That a Graph is H-Linked.

[BibT_eX]

[DOI]

Ronald J. Gould

SIAM J. Discret. Math., 2006

Nowhere-zero Z3-flows through Z3-connectivity.

[BibT_eX]

[DOI]

Matt DeVos

Rui Xu

Discret. Math., 2006

On Sufficient Degree Conditions for a Graph to be k-linked.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Comb. Probab. Comput., 2006

2005

An extremal problem for H-linked graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

2001

On maximal (k, b)-linear-free sets of integers and its spectrum.

[BibT_eX]

[DOI]

Lihua You