Research problem: The completion number of a graph

Author： Bakonyi M.  

Publisher： Taylor & Francis Ltd

ISSN： 0308-1087

Source： Linear and Multilinear Algebra, Vol.53, Iss.3, 2005-06, pp. : 189-192

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Geodetic Number of an Oriented Graph

By Chartrand G.   Zhang P.  

European Journal of Combinatorics, Vol. 21, Iss. 2, 2000-02 ,pp. : 181-189

Elsevier

Access to resources Recommend Favorite

A graph-based estimator of the number of clusters

By Biau Gérard   Cadre Benoît   Pelletier Bruno  

ESAIM: Probability and Statistics, Vol. 11, Iss. issue, 2007-06 ,pp. : 272-280

Edp Sciences

Access to resources Recommend Favorite

Adjacent edge conditions for the totally nonnegative completion problem

By Dryden Emily  

Linear and Multilinear Algebra, Vol. 56, Iss. 3, 2008-05 ,pp. : 261-277

Taylor & Francis Ltd

Access to resources Recommend Favorite

Complete solution to the TP2 completion problem

By Johnson C.R.   Nasserasr S.  

Linear and Multilinear Algebra, Vol. 62, Iss. 10, 2014-10 ,pp. : 1403-1420

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the number of edges not covered by monochromatic copies of a fixed graph

By Keevash P.   Sudakov B.  

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 41-53

Elsevier

Access to resources Recommend Favorite