On maximum matchings in cubic graphs with a bounded number of bridge-covering paths

Publisher： Cambridge University Press

E-ISSN： 1755-1633|36|3|441-447

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.36, Iss.3, 1987-12, pp. : 441-447

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

Matchings in graphs

By  

Bulletin of the Australian Mathematical Society, Vol. 9, Iss. 1, 1973-08 ,pp. : 141-143

Cambridge University Press

Access to resources Recommend Favorite

Covering Planar Graphs with a Fixed Number of Balls

By Chepoi Victor   Estellon Bertrand   Vaxes Yann  

Discrete & Computational Geometry, Vol. 37, Iss. 2, 2007-02 ,pp. : 237-244

Springer Publishing Company

Access to resources Recommend Favorite

On the Number of 3-Edge Colorings of Cubic Graphs

By Szegedy C.  

European Journal of Combinatorics, Vol. 23, Iss. 1, 2002-01 ,pp. : 113-120

Elsevier

Access to resources Recommend Favorite

Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree

By Dong Ai   Wang Guang  

Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. : 703-709

Springer Publishing Company

Access to resources Recommend Favorite

Crossing-number critical graphs have bounded path-width

By Hlineny P.  

Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. : 347-367

Elsevier

Access to resources Recommend Favorite