E. Máčajová

From MaRDI portal
Person:311541

Available identifiers

zbMath Open macajova.editaMaRDI QIDQ311541

List of research outcomes





PublicationDate of PublicationType
Flow number and circular flow number of signed cubic graphs2024-10-18Paper
Permutation snarks of order \(2 \pmod{8}\)2024-10-18Paper
Cubic graphs with colouring defect 32024-04-09Paper
Flow resistance to resistance ratios in cubic graphs2024-01-24Paper
Some snarks are worse than others2024-01-23Paper
Colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson2023-12-21Paper
Strong edge colorings of graphs and the covers of Kneser graphs2023-10-05Paper
Three-cuts are a charm: acyclicity in 3-connected cubic graphs2023-09-13Paper
Frank number and nowhere-zero flows on graphs2023-05-03Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching2023-03-23Paper
Berge's conjecture for cubic graphs with small colouring defect2022-10-24Paper
Decomposition of cubic graphs with cyclic connectivity 52022-08-24Paper
Girth, oddness, and colouring defect of snarks2022-08-24Paper
Flow number and circular flow number of signed cubic graphs2022-05-27Paper
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching2022-04-21Paper
Snarks with resistance \(n\) and flow resistance \(2n\)2022-04-04Paper
Cubic Graphs with No Short Cycle Covers2021-10-18Paper
Cubic graphs that cannot be covered with four perfect matchings2021-07-06Paper
Perfect Matching Index versus Circular Flow Number of a Cubic Graph2021-06-28Paper
Critical and flow-critical snarks coincide2021-02-10Paper
Superposition of snarks revisited2021-02-08Paper
Corrigendum to: ``On even cycle decompositions of 4-regular line graphs2020-12-04Paper
Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks2020-09-03Paper
The smallest nontrivial snarks of oddness 42020-03-23Paper
Shorter signed circuit covers of graphs2019-10-31Paper
Circuit Covers of Signed Eulerian Graphs2019-08-29Paper
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 442019-07-25Paper
The difference between the circular and the integer flow number of bidirected graphs2017-09-28Paper
Nowhere-Zero Flows on Signed Eulerian Graphs2017-09-18Paper
Odd Decompositions of Eulerian Graphs2017-09-18Paper
Characteristic flows on signed graphs and short circuit covers2016-09-13Paper
Cubic Graphs with Large Circumference Deficit2016-08-12Paper
Circuit Covers of Signed Graphs2016-02-01Paper
The chromatic number of a signed graph2016-01-25Paper
Small snarks with large oddness2015-03-11Paper
Remarks on nowhere-zero flows in signed cubic graphs2015-01-30Paper
Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs2015-01-21Paper
Sparsely intersecting perfect matchings in cubic graphs2014-08-14Paper
Snarks with large oddness and small number of vertices2014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54199862014-06-11Paper
\(k\)-regular graphs with the circular chromatic index close to \(k\)2014-02-27Paper
On even cycle decompositions of 4-regular line graphs2013-12-05Paper
Determining the flow numbers of signed Eulerian graphs2013-11-01Paper
On the flow numbers of signed complete and complete bipartite graphs2013-11-01Paper
Coloring cubic graphs by point-intransitive Steiner triple systems2013-10-21Paper
On a conjecture of Fan and Raspaud2013-10-10Paper
Circular edge-colorings of cubic graphs with girth six2013-10-10Paper
Wilson-Schreiber colourings of cubic graphs2013-10-10Paper
Bridgeless cubic graphs are (7,2)-edge-choosable2013-09-26Paper
Optimal acyclic edge‐coloring of cubic graphs2012-11-23Paper
6-decomposition of snarks2012-11-15Paper
Circuits of length 5 in 2-factors of cubic graphs2012-07-04Paper
Infinitely many hypohamiltonian cubic graphs of girth 72012-01-24Paper
Short cycle covers of graphs and nowhere-zero flows2011-12-20Paper
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs2011-06-03Paper
Circular edge-colorings of cubic graphs with girth six2010-06-03Paper
Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs2010-03-31Paper
Projective, affine, and abelian colorings of cubic graphs2009-01-27Paper
Characterization of affine Steiner triple systems and Hall triple systems2008-06-05Paper
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems2008-06-05Paper
Abelian Colourings of Cubic Graphs2007-05-29Paper
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 62007-05-29Paper
Constructing hypohamiltonian snarks with cyclic connectivity 5 and 62007-03-12Paper
On the strong circular 5‐flow conjecture2006-09-06Paper
Irreducible snarks of given order and cyclic connectivity2006-06-30Paper
Fano colourings of cubic graphs and the Fulkerson conjecture2006-03-20Paper
An 8-flow theorem for signed graphsN/APaper

Research outcomes over time

This page was built for person: E. Máčajová