Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Book
%1 asratian2008bipartite
%A Asratian, Armen S.
%A Denley, Tristan M. J.
%A Häggkvist, Roland
%B Cambridge Tracts in Mathematics
%C Cambridge
%D 1998
%I Cambridge University Press
%K 05-01-combinatorics-research-exposition 05b15-orthogonal-arrays-latin-squares-room-squares 05c05-trees 05c15-coloring-of-graphs-and-hypergraphs 05c50-graphs-and-linear-algebra 05c70-factorization-matching-partitioning 05c90-graph-theory-applications
%T Bipartite Graphs and Their Applications
%V 131
@book{asratian2008bipartite,
added-at = {2023-08-21T02:10:42.000+0200},
address = {Cambridge},
author = {Asratian, Armen S. and Denley, Tristan M. J. and H\"{a}ggkvist, Roland},
biburl = {https://www.bibsonomy.org/bibtex/201960812d8c6a07651057303fec332d9/gdmcbain},
interhash = {b91237c08db2509934460d57ef701475},
intrahash = {01960812d8c6a07651057303fec332d9},
keywords = {05-01-combinatorics-research-exposition 05b15-orthogonal-arrays-latin-squares-room-squares 05c05-trees 05c15-coloring-of-graphs-and-hypergraphs 05c50-graphs-and-linear-algebra 05c70-factorization-matching-partitioning 05c90-graph-theory-applications},
publisher = {Cambridge University Press},
refid = {214307018},
series = {Cambridge Tracts in Mathematics},
timestamp = {2023-08-21T02:11:12.000+0200},
title = {Bipartite Graphs and Their Applications},
volume = 131,
year = 1998
}