AMS eContent Search Results
Matches for: msc=(05C70) AND publication=(mcom)
Sort order: Date
Format: Standard display

  
Results: 1 to 3 of 3 found      Go to page: 1

[1] Thomas Barron, Christopher O’Neill and Roberto Pelayo. On dynamic algorithms for factorization invariants in numerical monoids. Math. Comp. 86 (2017) 2429-2447.
Abstract, references, and article information   
View Article: PDF

[2] Anderson N. Martinhão and Emerson L. Monte Carmelo. Short covering codes arising from matchings in weighted graphs. Math. Comp. 82 (2013) 605-616. MR 2983038.
Abstract, references, and article information   
View Article: PDF

[3] E. Seah and D. R. Stinson. On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groups . Math. Comp. 50 (1988) 607-618. MR 929557.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 1 to 3 of 3 found      Go to page: 1