André Raspaud

Weiqiang Yu

J. Graph Theory, 2022

Injective edge-coloring of subcubic graphs.

[BibT_eX]

[DOI]

Baya Ferdjallah

Discret. Math. Algorithms Appl., 2022

2021

Cut-Edges and Regular Factors in Regular Graphs of Odd Degree.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Injective edge-coloring of graphs with given maximum degree.

[BibT_eX]

[DOI]

Jingwei Xu

Eur. J. Comb., 2021

On star edge colorings of bipartite and subcubic graphs.

[BibT_eX]

[DOI]

Carl Johan Casselgren

Jonas B. Granholm

Discret. Appl. Math., 2021

2020

Choosability with separation of planar graphs without prescribed cycles.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

2019

Oriented incidence colourings of digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

List star edge-coloring of k-degenerate graphs and K4-minor free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Acyclic improper choosability of subcubic graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

Strong edge-colorings of sparse graphs with large maximum degree.

[BibT_eX]

[DOI]

Ilkyoo Choi

Jaehoon Kim

Eur. J. Comb., 2018

List star edge-coloring of subcubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

List star chromatic index of sparse graphs.

[BibT_eX]

[DOI]

Kavita Pradeep

Discret. Math., 2018

List star edge coloring of sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

On weight choosabilities of graphs with bounded maximum average degree.

[BibT_eX]

[DOI]

Jakub Przybylo

Mariusz Wozniak

Discret. Appl. Math., 2017

Incidence coloring of graphs with high maximum average degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Circuit Covers of Signed Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

A (3, 1) ∗-choosable theorem on planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

The Chromatic Number of a Signed Graph.

[BibT_eX]

[DOI]

Edita Mácajová

Martin Skoviera

Electron. J. Comb., 2016

2015

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

[BibT_eX]

[DOI]

Ilkyoo Choi

Discret. Math., 2015

2014

Limits of Near-Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Star list chromatic number of planar subcubic graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Obstructions to locally injective oriented improper colourings.

[BibT_eX]

[DOI]

Gary MacGillivray

Jacobus Swarts

Eur. J. Comb., 2014

Strong chromatic index of planar graphs with large girth.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

On (3, 2)*-choosability of planar graphs without adjacent short cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Generalized Power Domination in Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

6-Star-Coloring of Subcubic Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

L(p, q)-labeling of sparse graphs.

[BibT_eX]

[DOI]

Clément Charpentier

J. Comb. Optim., 2013

(3, 1)*-choosability of planar graphs without adjacent short cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687].

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

On strong edge-colouring of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Planar graphs without 4- and 5-cycles are acyclically 4-choosable.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

A sufficient condition for planar graphs to be acyclically 5-choosable.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Decomposing a graph into forests.

[BibT_eX]

[DOI]

Patrice Ossona de Mendez

J. Comb. Theory B, 2012

On backbone coloring of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Some results on the injective chromatic number of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Preface.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Vertex-arboricity of planar graphs without intersecting triangles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Upper k-tuple domination in graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

Some structural properties of planar graphs and their applications to 3-choosability.

[BibT_eX]

[DOI]

Discret. Math., 2012

(k, 1)-coloring of sparse graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

The minimum identifying code graphs.

[BibT_eX]

[DOI]

Li-Da Tong

Discret. Appl. Math., 2012

On the size of identifying codes in triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Generalized power domination of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Covering a Graph by Forests and a Matching.

[BibT_eX]

[DOI]

Tomás Kaiser

SIAM J. Discret. Math., 2011

Short cycle covers of graphs and nowhere-zero flows.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Circular flow on signed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Obstructions to Injective Oriented Colourings.

[BibT_eX]

[DOI]

Gary MacGillivray

Jacobus Swarts

Electron. Notes Discret. Math., 2011

Minmax degree of graphs (Extended abstract).

[BibT_eX]

[DOI]

Clément Charpentier

Electron. Notes Discret. Math., 2011

8-star-choosability of a graph with maximum average degree less than 3.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2011

Upper bounds on the linear chromatic number of a graph.

[BibT_eX]

[DOI]

Chao Li

Discret. Math., 2011

Acyclic 4-choosability of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

(k, j)-coloring of sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Decomposition of sparse graphs into two forests, one having bounded maximum degree.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Perfect matchings with restricted intersection in cubic graphs.

[BibT_eX]

[DOI]

Tomás Kaiser

Eur. J. Comb., 2010

Decomposition of sparse graphs, with application to game coloring number.

[BibT_eX]

[DOI]

Discret. Math., 2010

Some bounds on the injective chromatic number of graphs.

[BibT_eX]

[DOI]

Alain Doyon

Gena Hahn

Discret. Math., 2010

Homomorphisms from sparse graphs to the Petersen graph.

[BibT_eX]

[DOI]

Discret. Math., 2010

On acyclic 4-choosability of planar graphs without short cycles.

[BibT_eX]

[DOI]

Discret. Math., 2010

Planar graphs without adjacent cycles of length at most seven are 3-colorable.

[BibT_eX]

[DOI]

Discret. Math., 2010

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles.

[BibT_eX]

[DOI]

Anna O. Ivanova

Discret. Math., 2010

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable.

[BibT_eX]

[DOI]

Alexei N. Glebov

Discret. Math., 2010

Acyclic 3-choosability of sparse graphs with girth at least 7.

[BibT_eX]

[DOI]

Discret. Math., 2010

A note on the acyclic 3-choosability of some planar graphs.

[BibT_eX]

[DOI]

Hervé Hocquard

Discret. Appl. Math., 2010

2009

Star coloring of sparse graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Game chromatic number of toroidal grids.

[BibT_eX]

[DOI]

Jiaojiao Wu

Electron. Notes Discret. Math., 2009

European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Chromatic number of sparse colored mixed planar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

An upper bound on adaptable choosability of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Projective, affine, and abelian colorings of cubic graphs.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Martin Skoviera

Eur. J. Comb., 2009

Linear coloring of planar graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 2009

Antibandwidth and cyclic antibandwidth of meshes and hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2009

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.

[BibT_eX]

[DOI]

Discret. Math., 2009

Preface.

[BibT_eX]

[DOI]

Olivier Delmas

Discret. Math., 2009

Injective coloring of planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Injective Oriented Colourings.

[BibT_eX]

[DOI]

Gary MacGillivray

Jacobus Swarts

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008

A relaxation of Havel's 3-color problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Acyclic coloring of graphs of maximum degree five: Nine colors are enough.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Homomorphisms of 2-edge-colored graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

On the vertex-arboricity of planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Linear choosability of graphs.

[BibT_eX]

[DOI]

Louis Esperet

Discret. Math., 2008

On Injective Colourings of Chordal Graphs.

[BibT_eX]

[DOI]

Pavol Hell

Juraj Stacho

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

List circular coloring of trees and cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Acyclic 5-choosability of planar graphs without small cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Three-coloring planar graphs without short cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract.

[BibT_eX]

[DOI]

Nicolas Roussel

Electron. Notes Discret. Math., 2007

Non-intersecting perfect matchings in cubic graphs (Extended abstract).

[BibT_eX]

[DOI]

Tomás Kaiser

Electron. Notes Discret. Math., 2007

L(p, q) labeling of d-dimensional grids.

[BibT_eX]

[DOI]

Discret. Math., 2007

(d, 1)-total labelling of planar graphs with large girth and high maximum degree.

[BibT_eX]

[DOI]

Fabrice Bazzaro

Discret. Math., 2007

On Oriented Labelling Parameters.

[BibT_eX]

[DOI]

Daniel Gonçalves

M. A. Shalu

Proceedings of the Formal Models, 2007

2006

(d, 1)-total labeling of graphs with a given maximum average degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

On the acyclic choosability of graphs.

[BibT_eX]

[DOI]

Pascal Ochem

J. Graph Theory, 2006

On the strong circular 5-flow conjecture.

[BibT_eX]

[DOI]

Edita Mácajová

J. Graph Theory, 2006

A note on 2-facial coloring of plane graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Bordeaux 3-color conjecture and 3-choosability.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Planar graphs without cycles of length from 4 to 7 are 3-colorable.

[BibT_eX]

[DOI]

Alexei N. Glebov

Mohammad R. Salavatipour

J. Comb. Theory B, 2005

Abelian Colourings of Cubic Graphs.

[BibT_eX]

[DOI]

Edita Mácajová

Martin Skoviera

Electron. Notes Discret. Math., 2005

2004

Antisymmetric flows and edge-connectivity.

[BibT_eX]

[DOI]

Matt DeVos

Discret. Math., 2004

A survey on Knödel graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.

[BibT_eX]

[DOI]

Ondrej Sýkora

Proceedings of the Structural Information and Communication Complexity, 2004

2003

A sufficient condition for planar graphs to be 3-colorable.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

On the oriented chromatic number of grids.

[BibT_eX]

[DOI]

Arup Roychowdhury

Inf. Process. Lett., 2003

Acyclic and k-distance coloring of the grid.

[BibT_eX]

[DOI]

Emmanuel Godard

Inf. Process. Lett., 2003

Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.

[BibT_eX]

Francesc Comellas

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002

Acyclic list 7-coloring of planar graphs.

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

J. Graph Theory, 2002

Nilpotent Families of Endomorphisms of (p(V)+, cup).

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

J. Comb. Theory B, 2002

Minimum feedback vertex set and acyclic coloring.

[BibT_eX]

[DOI]

Emmanuel Godard

Inf. Process. Lett., 2002

2001

On Deeply Critical Oriented Graphs.

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

J. Comb. Theory B, 2001

Neighborhood Communications in Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On nice graphs.

[BibT_eX]

[DOI]

Pavol Hell

Discret. Math., 2001

All-to-all wavelength-routing in all-optical compound networks.

[BibT_eX]

[DOI]

Denise Amar

Olivier Togni

Discret. Math., 2001

Acyclic colouring of 1-planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Small k-Dominating Sets in Planar Graphs with Applications.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

On Star Coloring of Graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

k-Neighborhood Broadcasting.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

2000

Colored Homomorphisms of Colored Mixed Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Recognizing Recursive Circulant Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Diameter of the Knödel Graph.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Congestion and dilation, similarities and differences: A survey.

[BibT_eX]

Ondrej Sýkora

Imrich Vrto

Proceedings of the SIROCCO 7, 2000

1999

On the maximum average degree and the oriented chromatic number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1998

On universal graphs for planar oriented graphs of a given girth.

[BibT_eX]

[DOI]

Discret. Math., 1998

Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition.

[BibT_eX]

[DOI]

Ginette Gauyacq

C. Micheneau

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Families of Graphs Having Broadcasting and Gossiping Properties.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

Colorings and girth of oriented planar graphs.

[BibT_eX]

[DOI]

Jarik Nesetril

Discret. Math., 1997

Periodic Gossiping in Back-to-back Trees.

[BibT_eX]

[DOI]

Roger Labahn

Discret. Appl. Math., 1997

Broadcasting and Multicasting in Cut-through Routed Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

Hamiltonian properties and the bipartite independence number.

[BibT_eX]

[DOI]

Oscar Ordaz

Denise Amar

Discret. Math., 1996

1995

Cutwidth of the Bruijn Graph.

[BibT_eX]

[DOI]

Ondrej Sýkora

Imrich Vrto

RAIRO Theor. Informatics Appl., 1995

On Bandwidth, Cutwidth, and Quotient Graphs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Compatible Eulerian Circuits in Kn**.

[BibT_eX]

[DOI]

Dominique Barth

Johny Bond

Discret. Appl. Math., 1995

1994

Fulkerson's Conjecture and Circuit Covers.

[BibT_eX]

[DOI]

Genghua Fan

J. Comb. Theory B, 1994

Good and Semi-Strong Colorings of Oriented Planar Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph.

[BibT_eX]

[DOI]

Dominique Barth

Inf. Process. Lett., 1994

1993

Postman tours and cycle covers.

[BibT_eX]

[DOI]

Discret. Math., 1993

1991

Cycle covers of graphs with a nowhere-zero 4-flow.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Covering the vertices of a digraph by cycles of prescribed length.

[BibT_eX]

[DOI]

Denise Amar

Discret. Math., 1991

1987

Short circuit covers for regular matroids with a nowhere zero 5-flow.

[BibT_eX]

[DOI]

Ury Jamshy

Michael Tarsi

J. Comb. Theory B, 1987

1985

Flots et couvertures par des cycles dans les graphes et les matroïdes. (Flows and coverings by cycles in graphs and matroids).

[BibT_eX]

[DOI]