Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Hartfiel, D. J.
1975.
A Canonical Form For Fully Indecomposable (0,1)-Matrices.
Canadian Mathematical Bulletin,
Vol. 18,
Issue. 2,
p.
223.
Brualdl, Richard A.
and
Foregger, Thomas H.
1975.
Matrices with constant permanental minors†.
Linear and Multilinear Algebra,
Vol. 3,
Issue. 3,
p.
227.
Voorhoeve, M.
1979.
A lower bound for the permanents of certain (0,1)-matrices.
Indagationes Mathematicae (Proceedings),
Vol. 82,
Issue. 1,
p.
83.
Brualdi, Richard A.
1980.
Matrices of zeros and ones with fixed row and column sum vectors.
Linear Algebra and its Applications,
Vol. 33,
Issue. ,
p.
159.
Nosov, V. A.
Sachkov, V. N.
and
Tarakanov, V. E.
1983.
Combinatorial analysis (matrix problems, order theory).
Journal of Soviet Mathematics,
Vol. 21,
Issue. 6,
p.
910.
Sereni, Jean-Sébastien
2008.
Randomly colouring graphs (a combinatorial view).
Computer Science Review,
Vol. 2,
Issue. 2,
p.
63.
Král', Daniel
Sereni, Jean-Sébastien
and
Stiebitz, Michael
2009.
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 23,
Issue. 3,
p.
1465.
Esperet, Louis
Král’, Daniel
Škoda, Petr
and
Škrekovski, Riste
2010.
An improved linear bound on the number of perfect matchings in cubic graphs.
European Journal of Combinatorics,
Vol. 31,
Issue. 5,
p.
1316.