Results 91 to 100 of about 553,680 (181)

Coloring cayley tables of finite groups

open access: yes, 2017
The chromatic number of a latin square L, denoted χ(L), is defined as the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin square L satisfies χ(L) ≤ |L| + 2. If true, this would resolve a longstanding conjecture, commonly attributed to Brualdi, that every latin square has a partial ...
openaire   +1 more source

Honeyeaters [picture] /

open access: yes, 1950
Title devised by cataloguer from inscription.; Part of the collection: Gould League collection of prints and watercolours of Australian birds and animals.; Inscriptions: "Honeyeaters.
Cayley, Neville W. (Neville William), 1886-1950.
core  

Fairy wrens [picture] /

open access: yes, 1950
Title devised by cataloguer from inscription.; Part of the collection: Gould League collection of prints and watercolours of Australian birds and animals.; Inscriptions: "Fairy wrens.
Cayley, Neville W. (Neville William), 1886-1950.
core  

Lorikeets [picture] /

open access: yes, 1950
Title devised by cataloguer from inscription.; Part of the collection: Gould League collection of prints and watercolours of Australian birds and animals.; Inscriptions: "Lorikeets.
Cayley, Neville W. (Neville William), 1886-1950.
core  

k-Cayley trees

open access: yes, 2016
A tree in which each non-leaf graph vertex has a constant number of branches k is called a k-Cayley tree. 2-Cayley trees are path graphs. The unique k-Cayley tree on k+1 nodes is the star graph.
Wolfram, Stephen, Piękniewski, Filip
core   +1 more source

Study of Rivaroxaban for Cerebral Venous Thrombosis: A Randomized Controlled Feasibility Trial Comparing Anticoagulation With Rivaroxaban to Standard-of-Care in Symptomatic Cerebral Venous Thrombosis. [PDF]

open access: yesStroke, 2023
Field TS   +37 more
europepmc   +1 more source

k-Cayley trees

open access: yes, 2013
A tree in which each non-leaf graph vertex has a constant number of branches k is called a k-Cayley tree. 2-Cayley trees are path graphs. The unique k-Cayley tree on k+1 nodes is the star graph.
Wolfram, Stephen, Piękniewski, Filip
core   +1 more source

Home - About - Disclaimer - Privacy