Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.27, Iss.3, 2014-04, pp. : 519-529

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

Acyclic 4-coloring of planar graphs without 4- and 5-cycles

By Borodin O.

Journal of Applied and Industrial Mathematics, Vol. 5, Iss. 1, 2011-01 ,pp. : 31-43

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Acyclic 5-choosability of planar graphs without 4-cycles

By Borodin O.

Siberian Mathematical Journal, Vol. 52, Iss. 3, 2011-05 ,pp. : 411-425

Springer Publishing Company

Access to resources Recommend Favorite

Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12

By Borodin O.

Journal of Applied and Industrial Mathematics, Vol. 4, Iss. 2, 2010-04 ,pp. : 158-162

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Vertex arboricity of planar graphs without chordal 6-cycles

By Huang Danjun Wang Weifan

International Journal of Computer Mathematics, Vol. 90, Iss. 2, 2013-02 ,pp. : 258-272

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs

By Southey Justin

Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. : 547-554

Springer Publishing Company

Access to resources Recommend Favorite