On minimal triangle-free planar graphs with prescribed 1-defective chromatic number

arXiv1501.04387MaRDI QIDQ6258243FDOQ6258243

Authors: Nirmala Achuthan, N. R. Achuthan, G. Keady 

Publication date: 18 January 2015

Abstract: A graph is (m,k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced on the set of all vertices receiving the same colour is at most k. The k-defective chromatic number $ch{i}_k(G)$ is the least positive integer $m$ for which graph G is (m,k)-colourable. Let f(m,k;tfp) be the smallest order of a triangle-free planar graph such that $ch{i}_k(G)$=m. In this paper we show that f(3,1;tfp)=11.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On minimal triangle-free planar graphs with prescribed 1-defective chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258243)