Printer Friendly

Articles from Discrete Mathematics and Theoretical Computer Science (January 1, 2014)

1-8 out of 8 article(s)
Title Author Type Words
Computation with no memory, and rearrangeable multicast networks. Burckel, Serge; Gioan, Emeric; Thome, Emmanuel Report 12682
Descents after maxima in compositions. Blecher, Aubrey; Brennan, Charlotte; Knopfmacher, Arnold Report 3788
Efficient open domination in graph products. Kuziak, Dorota; Peterin, Iztok; Yero, Ismael G. Report 12374
Graphs where every k-subset of vertices is an identifying set. Gravier, Sylvain; Janson, Svante; Laihonen, Tero; Ranto, Sanna Report 11355
List circular backbone colouring. Havet, Frederic; King, Andrew D. Report 11081
On Hamiltonian paths and cycles in sufficiently large distance graphs. Lowenstein, Christian; Rautenbach, Dieter; Sotak, Roman Report 9680
On size, radius and minimum degree. Mukwembi, Simon Report 2175
The price of mediation. Bradonjic, Milan; Ercal, Gunes; Meyerson, Adam; Roytman, Alan Report 18185

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |