On a Problem of Cameron’s on Inexhaustible Graphs

ISSN： 0209-9683

Source： Combinatorica, Vol.24, Iss.1, 2004-01, pp. : 35-51

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

Related content

On reductions for the Steiner Problem in Graphs

By Kingston J.H. Sheppard N.P.

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 77-88

Elsevier

Access to resources Recommend Favorite

The density maximization problem in graphs

By Kao Mong-Jen Katz Bastian Krug Marcus Lee D. Rutter Ignaz Wagner Dorothea

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 723-754

Springer Publishing Company

Access to resources Recommend Favorite

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

By Babel L. Ponomarenko I.N. Tinhofer G.

Journal of Algorithms, Vol. 21, Iss. 3, 1996-11 ,pp. : 542-564

Academic Press

Access to resources Recommend Favorite

The p-maxian problem on block graphs

By Kang Liying Cheng Yukun

Journal of Combinatorial Optimization, Vol. 20, Iss. 2, 2010-08 ,pp. : 131-141

Springer Publishing Company

Access to resources Recommend Favorite

Ambiguous Groups and Cayley Graphs—A Problem in Distinguishing Opposites

By Goldstone Richard McCabe John Weld Kathryn

Mathematics Magazine, Vol. 83, Iss. 5, 2010-12 ,pp. : 347-358

Mathematical Association of America

Access to resources Recommend Favorite