Two proofs of Bermond-Thomassen conjecture for regular tournaments (Q3439564): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123277985, #quickstatements; #temporary_batch_1710858552373 |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.endm.2007.01.008 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.endm.2007.01.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2010264092 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4539516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles in digraphs– a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning vertices of a tournament into independent cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The partition of a strong tournament / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.ENDM.2007.01.008 / rank | |||
Normal rank |
Latest revision as of 07:22, 21 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two proofs of Bermond-Thomassen conjecture for regular tournaments |
scientific article |
Statements
Two proofs of Bermond-Thomassen conjecture for regular tournaments (English)
0 references
29 May 2007
0 references
digraph
0 references
circuit
0 references
tournament
0 references
Bermond-Thomassen conjecture
0 references
cycle
0 references