Triangle-free oriented graphs and the traceability conjecture (Q898141): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123149706, #quickstatements; #temporary_batch_1710976035288 |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2015.10.022 / rank | |||
Property / cites work | |||
Property / cites work: Digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3575434 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative approach to the traceability conjecture for oriented graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Traceability of \(k\)-traceable oriented graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A traceability conjecture for oriented graphs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2015.10.022 / rank | |||
Normal rank |
Latest revision as of 07:39, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Triangle-free oriented graphs and the traceability conjecture |
scientific article |
Statements
Triangle-free oriented graphs and the traceability conjecture (English)
0 references
8 December 2015
0 references
traceability conjecture
0 references
oriented graph
0 references
\(k\)-traceable
0 references
traceable oriented graph
0 references
girth
0 references