Tools for counting odd cycles in graphs (Q2338636): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through specified vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of edge critical 4-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of 5- and 6-chromatic abstract graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore's conjecture on color-critical graphs is almost true / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs of colour-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On critical subgraphs of colour-critical graphs / rank
 
Normal rank

Revision as of 00:59, 21 July 2024

scientific article
Language Label Description Also known as
English
Tools for counting odd cycles in graphs
scientific article

    Statements

    Identifiers