On maximum face-constrained coloring of plane graphs with no short face cycles

Publisher： Elsevier

ISSN： 0012-365X

Source： Discrete Mathematics, Vol.277, Iss.1, 2004-02, pp. : 301-307

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

Maximum cuts and judicious partitions in graphs without short cycles

By Alon N. Bollobas B. Krivelevich M. Sudakov B.

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

Elsevier

Access to resources Recommend Favorite

A note on list edge and list total coloring of planar graphs without adjacent short cycles

By Wang Hui Wu Jian

Acta Mathematica Sinica, Vol. 30, Iss. 1, 2014-01 ,pp. : 91-96

Springer Publishing Company

Access to resources Recommend Favorite

Geometric Realization of a Triangulation on the Projective Plane with One Face Removed

By Bonnington C. Nakamoto Atsuhiro

Discrete & Computational Geometry, Vol. 40, Iss. 1, 2008-07 ,pp. : 141-157

Springer Publishing Company

Access to resources Recommend Favorite

Orderings on Graphs and Game Coloring Number

By Kierstead H. A. Yang Daqing

Order, Vol. 20, Iss. 3, 2003-01 ,pp. : 255-264

Springer Publishing Company

Access to resources Recommend Favorite

Cycles in cubic graphs

Bulletin of the Australian Mathematical Society, Vol. 45, Iss. 2, 1992-04 ,pp. : 349-350

Cambridge University Press

Access to resources Recommend Favorite