An algorithm for identifying cycle-plus-triangles graphs (Q2357769): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Combinatorial Nullstellensatz / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Hamiltonian property of consecutive-\(d\) digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3983100 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A solution to a colouring problem of P. Erdős / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5689006 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4284625 / rank | |||
Normal rank |
Latest revision as of 23:04, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for identifying cycle-plus-triangles graphs |
scientific article |
Statements
An algorithm for identifying cycle-plus-triangles graphs (English)
0 references
14 June 2017
0 references
cycle-plus-triangles graph
0 references
\(C_4\)-free 2-matching
0 references
3-colouring
0 references