scientific article; zbMATH DE number 3728302
From MaRDI portal
Publication:3916595
Cited in
(only showing first 100 items - show all)- The cone of balanced subgraphs
- A note on antisymmetric flows in graphs
- Small cycle double covers of products. II: Categorical and strong products with paths and cycles
- A note on Berge-Fulkerson coloring
- Flows, flow-pair covers and cycle double covers
- On the cone of nonnegative circuits
- Semi-duality and the cycle double cover conjecture
- Cycle double covers of graphs with Hamilton paths
- Undirected distances and the postman-structure of graphs
- On fractional multicommodity flows and distance functions
- Distances and cuts in planar graphs
- Trigraphs
- Matroids and multicommodity flows
- Even circuits in planar graphs
- Short proofs on multicommodity flows and cuts
- Integer flows and cycle covers
- On cycle double covers of line graphs
- Hajós' conjecture and small cycle double covers of planar graphs
- The construction and reduction of strong snarks
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Small cycle cover of 2-connected cubic graphs
- A compact linear program for testing optimality of perfect matchings.
- On covers of graphs
- Circuit decompositions of Eulerian graphs
- Classification and characterizations of snarks
- Short signed circuit covers of signed graphs
- Circuit and bond polytopes on series-parallel graphs
- On the smallest snarks with oddness 4 and connectivity 2
- On circuit decomposition of planar Eulerian graphs
- Constructing and deconstructing Latin trades
- On minimum-genus embeddings
- Strong connectivity of polyhedral complexes
- Hilbert bases of cuts
- Nowhere-zero 4-flows and cycle double covers
- Reducible configurations for the cycle double cover conjecture
- Cuboids, a class of clutters
- Box-total dual integrality, box-integrality, and equimodular matrices
- The Schrijver system of the flow cone in series-parallel graphs
- Idealness of \(k\)-wise intersecting families
- Snarks with resistance \(n\) and flow resistance \(2n\)
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
- A model for finding transition-minors
- Signed circuit cover of bridgeless signed graphs
- The lattice of cycles of an undirected graph
- Max-multiflow/min-multicut for G+H series-parallel
- Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
- Cycle double covers and non-separating cycles
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Trader multiflow and box-TDI systems in series-parallel graphs
- On 2-factors with a bounded number of odd components
- Odd 2-factored snarks
- Representativity of Cayley maps
- A bound on the total size of a cut cover
- Decompositions of infinite graphs. I: Bond-faithful decompositions
- Cycle double covers and spanning minors. I
- Cycle double covers and spanning minors. II
- A note about shortest cycle covers
- Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture
- New techniques for cost sharing in combinatorial optimization games
- Circuit \(k\)-covers of signed graphs
- On snarks that are far from being 3-edge colorable
- Short cycle covers on cubic graphs by choosing a 2-factor
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
- Circuit extension and circuit double cover of graphs
- Cycle double covers and the semi-Kotzig frame
- Flows and parity subgraphs of graphs with large odd-edge-connectivity
- Generation and properties of snarks
- A note on seminormality of cut polytopes
- Idealness of k-wise intersecting families
- Minimum \(T\)-joins and signed-circuit covering
- Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
- On cycle cones and polyhedra
- Extended formulations in combinatorial optimization
- A note on strong embeddings of maximal planar graphs on non-orientable surfaces
- Small oriented cycle double cover of graphs
- Cycle selections
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- On the existence of graphs which can colour every regular graph
- A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
- Kotzig frames and circuit double covers
- Five-cycle double cover and shortest cycle cover
- Hypergraph edge representations with the use of homological paths
- Counting circuit double covers
- On Fan's conjecture about 4-flow
- Signed cycle double covers
- Cycle separating cuts in possible counterexamples to the cycle double cover and the Berge-Fulkerson conjectures
- Cycle covers of cubic multigraphs
- Limits of cycles and cover conjectures
- A note on the core of 2-matching games
- From coordinate subspaces over finite fields to ideal multipartite uniform clutters
- Simplicial surfaces with given automorphism group
- Non-separating cycles and 5-cycle double covers
- 4-coverable snarks, perfect matching cover, and Isaacs product
- Approximate cycle double cover
- An infinite family of snarks with perfect matching cover index 4
- Strong embeddings of minimum genus
- A note on Alon-Tarsi shortest cycle cover conjecture
- On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916595)