Ban–Linial's Conjecture and treelike snarks
From MaRDI portal
Publication:6057640
DOI10.1002/jgt.22837zbMath1522.05148arXiv2102.07667WikidataQ113915788 ScholiaQ113915788MaRDI QIDQ6057640
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07667
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Treelike snarks
- Computational results and new bounds for the circular flow number of snarks
- Fulkerson's conjecture and circuit covers
- A note on 2-bisections of claw-free cubic graphs
- Cubic graphs that cannot be covered with four perfect matchings
- On 3-bisections in cubic and subcubic graphs
- A note on 3-bisections in subcubic graphs
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- Internal Partitions of Regular Graphs
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- The equivalence of two conjectures of Berge and Fulkerson
- Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
- On Perfect Matching Coverings and Even Subgraph Coverings
- On (k,d)-colorings and fractional nowhere-zero flows
- 1‐Factor and Cycle Covers of Cubic Graphs
- Perfect Matching Index versus Circular Flow Number of a Cubic Graph
- S_12 and P_12-colorings of cubic graphs
- Flows and Bisections in Cubic Graphs
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: Ban–Linial's Conjecture and treelike snarks
