Eckhard Steffen

Isaak H. Wolf

Discret. Appl. Math., October, 2023

Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Algorithms for the genome median under a restricted measure of rearrangement.

[BibT_eX]

[DOI]

Fábio Viduani Martinez

RAIRO Oper. Res., May, 2023

2022

Edge colorings and circular flows on regular graphs.

[BibT_eX]

[DOI]

Davide Mattiolo

J. Graph Theory, 2022

Highly edge-connected regular graphs without large factorizable subgraphs.

[BibT_eX]

[DOI]

Davide Mattiolo

J. Graph Theory, 2022

Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.

[BibT_eX]

[DOI]

Isaak H. Wolf

Graphs Comb., 2022

Frustration-critical signed graphs.

[BibT_eX]

[DOI]

Chiara Cappello

Discret. Appl. Math., 2022

2021

Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.

[BibT_eX]

[DOI]

Antje Klopp

Graphs Comb., 2021

Concepts of signed graph coloring.

[BibT_eX]

[DOI]

Alexander Vogel

Eur. J. Comb., 2021

2020

Flows on Signed Graphs without Long Barbells.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

2019

Fractional matchings and component-factors of (edge-chromatic critical) graphs.

[BibT_eX]

[DOI]

Antje Klopp

CoRR, 2019

2018

Circular coloring of signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Cores, joins and the Fano-flow conjectures.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

Flows in Signed Graphs with Two Negative Edges.

[BibT_eX]

[DOI]

Edita Rollová

Michael Schubert

Electron. J. Comb., 2018

Measures of Edge-Uncolorability of Cubic Graphs.

[BibT_eX]

[DOI]

Miquel A. Fiol

Electron. J. Comb., 2018

Approximating Vizing's independence number conjecture.

[BibT_eX]

[DOI]

Australas. J Comb., 2018

2017

Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Petersen Cores and the Oddness of Cubic Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

2016

Choosability in signed planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

The chromatic spectrum of signed graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Remarks on planar edge-chromatic critical graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Face-Degree Bounds for Planar Critical Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Edge Colorings and Circular Flow Numbers of Regular Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

1-Factor and Cycle Covers of Cubic Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Nowhere-zero 5-flows.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Nowhere-zero flows on signed regular graphs.

[BibT_eX]

[DOI]

Michael Schubert

Eur. J. Comb., 2015

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

[BibT_eX]

[DOI]

Edita Mácajová

Discret. Math., 2015

Intersecting 1-factors and nowhere-zero 5-flows.

[BibT_eX]

[DOI]

Comb., 2015

2014

The Set of Circular Flow Numbers of Regular Graphs.

[BibT_eX]

[DOI]

Michael Schubert

J. Graph Theory, 2014

Petersen-colorings and some families of snarks.

[BibT_eX]

[DOI]

Jonas Hägglund

Ars Math. Contemp., 2014

2013

1-factors and circuits of cubic graphs.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Maximum Δ-edge-colorable subgraphs of class II graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

α-Labelings and the Structure of Trees with Nonzero α-Deficit.

[BibT_eX]

[DOI]

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

Nearly nowhere-zero r-flow graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Measures of edge-uncolorability.

[BibT_eX]

[DOI]

Discret. Math., 2012

2010

Bricks and conjectures of Berge, Fulkerson and Seymour

[BibT_eX]

[DOI]

CoRR, 2010

Maximum Delta-edge-colorable Subgraphs of Class II Graphs.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2008

Relating embedding and coloring properties of snarks.

[BibT_eX]

[DOI]

Bojan Mohar

Andrej Vodopivec

Ars Math. Contemp., 2008

2007

Tutte's 5-flow conjecture for highly cyclically connected cubic graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

2006

Erratum to "Reduction of symmetric configurations n3" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2004

Independent sets and 2-factors in edge-chromatic-critical graphs.

[BibT_eX]

[DOI]

Stefan Grünewald

J. Graph Theory, 2004

Measurements of edge-uncolorability.

[BibT_eX]

[DOI]

Discret. Math., 2004

2001

Circular flow numbers of regular multigraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

2000

A refinement of Vizing's theorem.

[BibT_eX]

[DOI]

Discret. Math., 2000

Reduction of Symmetric Configurations n3.

[BibT_eX]

[DOI]

Hans Georg Carstens

Thomas Dinski

Discret. Appl. Math., 2000

1999

Chromatic-index-critical graphs of even order.

[BibT_eX]

[DOI]

Stefan Grünewald

J. Graph Theory, 1999

Non-Bicritical Critical Snarks.

[BibT_eX]

[DOI]

Graphs Comb., 1999

Cyclically 5-edge connected non-bicritical critical snarks.

[BibT_eX]

[DOI]

Stefan Grünewald

Discuss. Math. Graph Theory, 1999

Counterexamples to a conjecture about Petersen-minors in supersnarks.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Chromatic-Index-Critical Graphs of Orders 11 and 12.

[BibT_eX]

[DOI]

Gunnar Brinkmann

Eur. J. Comb., 1998

Classifications and characterizations of snarks.

[BibT_eX]

[DOI]

Discret. Math., 1998

Snarks and Reducibility.

[BibT_eX]

Gunnar Brinkmann

Ars Comb., 1998

1997

3- and 4-critical graphs of small even order.

[BibT_eX]

[DOI]

Gunnar Brinkmann

Discret. Math., 1997

1996

Tutte's 5-flow conjecture for graphs of nonorientable genus 5.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Star Chromatic Numbers of Graphs.

[BibT_eX]

[DOI]

Xuding Zhu

Comb., 1996

1991

Die Komplexität von Entscheidungsproblemen in der "Default Logic" und der autoepistemischen Logik.

[BibT_eX]

[DOI]