Coloring Sums of Extensions of Certain Graphs

zbMATH Open1425.05059arXiv1602.03735MaRDI QIDQ5241164FDOQ5241164

Saptarshi Bej, Johan Kok

Publication date: 30 October 2019

Abstract: Recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted by $chi(G).$ In this paper the concepts of $chi$'-chromatic sum and $ch{i}^{+}$-chromatic sum are introduced. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. We further the concepts of $chi$'-chromatic sum and $ch{i}^{+}$-chromatic sum to extended paths and cycles. The paper concludes with emph{patterned structured} graphs.

Full work available at URL: https://arxiv.org/abs/1602.03735

zbMATH Keywords

chromatic numberextended cycle\(\chi^+\)-chromatic sumextended path\(\chi^\prime\)-chromatic sum

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• On the \(b\)-chromatic number of regular graphs
• Generalised colouring sums of graphs
• \(b\)-chromatic sum of a graph
• On extension of regular graphs
• Certain chromatic sums of some cycle-related graph classes

Cited In (5)

• Coloring the Cartesian sum of graphs
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• Extension of colorings
• Cayley sum color and anti-circulant graphs
• Generalised colouring sums of graphs

This page was built for publication: Coloring Sums of Extensions of Certain Graphs

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