Edita Mácajová

Discret. Appl. Math., January, 2024

Cubic Graphs with Colouring Defect 3.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.

[BibT_eX]

[DOI]

Frantisek Kardos

Jean Paul Zerafa

J. Comb. Theory B, May, 2023

On the Frank Number and Nowhere-Zero Flows on Graphs.

[BibT_eX]

[DOI]

Jan Goedgebeur

Jarne Renders

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

2022

Strong edge colorings of graphs and the covers of Kneser graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Decomposition of cubic graphs with cyclic connectivity 5.

[BibT_eX]

[DOI]

Jozef Rajník

Discret. Math., 2022

Flow number and circular flow number of signed cubic graphs.

[BibT_eX]

[DOI]

Anna Kompisová

Discret. Math., 2022

Girth, oddness, and colouring defect of snarks.

[BibT_eX]

[DOI]

Discret. Math., 2022

Snarks with Resistance $n$ and Flow Resistance $2n$.

[BibT_eX]

[DOI]

Imran Allie

Electron. J. Comb., 2022

2021

Cubic Graphs with No Short Cycle Covers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Perfect Matching Index versus Circular Flow Number of a Cubic Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Cubic graphs that cannot be covered with four perfect matchings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Superposition of snarks revisited.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Critical and flow-critical snarks coincide.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699].

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

The smallest nontrivial snarks of oddness 4.

[BibT_eX]

[DOI]

Jan Goedgebeur

Discret. Appl. Math., 2020

2019

Circuit Covers of Signed Eulerian Graphs.

[BibT_eX]

[DOI]

Edita Rollová

SIAM J. Discret. Math., 2019

Shorter signed circuit covers of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44.

[BibT_eX]

[DOI]

Jan Goedgebeur

Ars Math. Contemp., 2019

2017

Nowhere-Zero Flows on Signed Eulerian Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Odd Decompositions of Eulerian Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

2016

Circuit Covers of Signed Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Cubic Graphs with Large Circumference Deficit.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Characteristic Flows on Signed Graphs and Short Circuit Covers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

The Chromatic Number of a Signed Graph.

[BibT_eX]

[DOI]

André Raspaud

Electron. J. Comb., 2016

2015

Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Edita Rollová

J. Graph Theory, 2015

The difference between the circular and the integer flow number of bidirected graphs.

[BibT_eX]

[DOI]

Eckhard Steffen

Discret. Math., 2015

Remarks on nowhere-zero flows in signed cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Small Snarks with Large Oddness.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

k-Regular graphs with the circular chromatic index close to k.

[BibT_eX]

[DOI]

Barbora Candráková

Discret. Math., 2014

Sparsely intersecting perfect matchings in cubic graphs.

[BibT_eX]

[DOI]

Comb., 2014

2013

Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

6-decomposition of snarks.

[BibT_eX]

[DOI]

Ján Karabás

Roman Nedela

Eur. J. Comb., 2013

On even cycle decompositions of 4-regular line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

2012

Optimal acyclic edge-coloring of cubic graphs.

[BibT_eX]

[DOI]

Lars Døvling Andersen

J. Graph Theory, 2012

Circuits of length 5 in 2-factors of cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Short cycle covers of graphs and nowhere-zero flows.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Determining the flow numbers of signed eulerian graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On the flow numbers of signed complete and complete bipartite graphs.

[BibT_eX]

[DOI]

Edita Rollová

Electron. Notes Discret. Math., 2011

An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2009

On a Conjecture of Fan and Raspaud.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Circular edge-colorings of cubic graphs with girth six.

[BibT_eX]

[DOI]

Daniel Král

Electron. Notes Discret. Math., 2009

Wilson-Schreiber Colourings of Cubic Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Projective, affine, and abelian colorings of cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

2007

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.

[BibT_eX]

[DOI]

Daniel Král

Attila Pór

Electron. Notes Discret. Math., 2007

Characterization of affine Steiner triple systems and Hall triple systems.

[BibT_eX]

[DOI]

Daniel Král

Attila Pór

Electron. Notes Discret. Math., 2007

Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

2006

On the strong circular 5-flow conjecture.

[BibT_eX]

[DOI]

André Raspaud

J. Graph Theory, 2006

Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Irreducible snarks of given order and cyclic connectivity.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Fano colourings of cubic graphs and the Fulkerson Conjecture.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Abelian Colourings of Cubic Graphs.

[BibT_eX]

[DOI]

André Raspaud