The following pages link to (Q3916595):
Displayed 50 items.
- Cycle covers of cubic multigraphs (Q686431) (← links)
- Strong embeddings of minimum genus (Q709302) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- On semiextensions and circuit double covers (Q875950) (← links)
- Cones of closed alternating walks and trails (Q880043) (← links)
- Non-separating cycles and discrete Jordan curves (Q913818) (← links)
- Cycle covers (I) - minimal contra pairs and Hamilton weights (Q974469) (← links)
- The cone of balanced subgraphs (Q1019652) (← links)
- A note on antisymmetric flows in graphs (Q1041206) (← links)
- Small cycle double covers of products. II: Categorical and strong products with paths and cycles (Q1043816) (← links)
- A note on Berge-Fulkerson coloring (Q1043939) (← links)
- Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
- On the cone of nonnegative circuits (Q1080435) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- Cycle double covers of graphs with Hamilton paths (Q1089005) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Distances and cuts in planar graphs (Q1121897) (← links)
- Trigraphs (Q1124613) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- Even circuits in planar graphs (Q1168333) (← links)
- Short proofs on multicommodity flows and cuts (Q1186123) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- On cycle double covers of line graphs (Q1193439) (← links)
- Hajós' conjecture and small cycle double covers of planar graphs (Q1197036) (← links)
- The construction and reduction of strong snarks (Q1356495) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Small cycle cover of 2-connected cubic graphs (Q1402087) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- On covers of graphs (Q1422433) (← links)
- Circuit decompositions of Eulerian graphs (Q1569071) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- On circuit decomposition of planar Eulerian graphs (Q1814589) (← links)
- Constructing and deconstructing Latin trades (Q1876678) (← links)
- On minimum-genus embeddings (Q1910582) (← links)
- Strong connectivity of polyhedral complexes (Q1915156) (← links)
- Hilbert bases of cuts (Q1916115) (← links)
- Nowhere-zero 4-flows and cycle double covers (Q1918555) (← links)
- Reducible configurations for the cycle double cover conjecture (Q1962036) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- Decompositions of infinite graphs. I: Bond-faithful decompositions (Q2485948) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- Cycle double covers and spanning minors. II (Q2495513) (← links)
- A note about shortest cycle covers (Q2581631) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- A note on strong embeddings of maximal planar graphs on non-orientable surfaces (Q5943373) (← links)