Tools for counting odd cycles in graphs
From MaRDI portal
Publication:2338636
DOI10.1016/j.jctb.2019.03.003zbMath1428.05162OpenAlexW2927674350MaRDI QIDQ2338636
Publication date: 21 November 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2019.03.003
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ore's conjecture on color-critical graphs is almost true
- On critical subgraphs of colour-critical graphs
- Subgraphs of colour-critical graphs
- Cycles through specified vertices of a graph
- A class of edge critical 4-chromatic graphs
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs
- The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
- On the structure of 5- and 6-chromatic abstract graphs.
This page was built for publication: Tools for counting odd cycles in graphs