maryam taleb - Academia.edu (original) (raw)

maryam taleb

Uploads

Papers by maryam taleb

Research paper thumbnail of Clique-Coloring of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow></mrow><annotation encoding="application/x-tex"></annotation></semantics></math></span><span class="katex-html" aria-hidden="true"></span></span>K_{3,3}$$K3,3-Minor Free Graphs

Bulletin of the Iranian Mathematical Society, 2019

A clique-coloring of a given graph G is a coloring of the vertices of G such that no maximal cliq... more A clique-coloring of a given graph G is a coloring of the vertices of G such that no maximal clique of size at least two is monocolored. The clique-chromatic number of G is the least number of colors for which G admits a clique-coloring. It has been proved that every planar graph is 3-clique colorable and every claw-free planar graph, different from an odd cycle, is 2-clique colorable. In this paper, we generalize these results to K 3,3-minor free (K 3,3-subdivision free) graphs.

Research paper thumbnail of Clique-Coloring of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow></mrow><annotation encoding="application/x-tex"></annotation></semantics></math></span><span class="katex-html" aria-hidden="true"></span></span>K_{3,3}$$K3,3-Minor Free Graphs

Bulletin of the Iranian Mathematical Society, 2019

A clique-coloring of a given graph G is a coloring of the vertices of G such that no maximal cliq... more A clique-coloring of a given graph G is a coloring of the vertices of G such that no maximal clique of size at least two is monocolored. The clique-chromatic number of G is the least number of colors for which G admits a clique-coloring. It has been proved that every planar graph is 3-clique colorable and every claw-free planar graph, different from an odd cycle, is 2-clique colorable. In this paper, we generalize these results to K 3,3-minor free (K 3,3-subdivision free) graphs.

Log In