Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Proper edge coloring of subcubic graphs with rainbow C4-s
View through CrossRef
A proper edge-coloring of a graph is called a B-coloring if every 4-cycle receives four distinct colors. Let qB(G) denote the minimum number of colors required for a B-coloring of a graph G. Motivated by earlier work related to the (7,4)-problem and subsequent studies on upper bounds for qB(G), we investigate this parameter for graphs of maximum degree three. We show that every subcubic graph G distinct from K3,3 satisfies qB(G) ≤ 6, and that this bound is best possible. Moreover, we provide a complete characterization of the subcubic graphs for which equality holds.
Title: Proper edge coloring of subcubic graphs with rainbow C4-s
Description:
A proper edge-coloring of a graph is called a B-coloring if every 4-cycle receives four distinct colors.
Let qB(G) denote the minimum number of colors required for a B-coloring of a graph G.
Motivated by earlier work related to the (7,4)-problem and subsequent studies on upper bounds for qB(G), we investigate this parameter for graphs of maximum degree three.
We show that every subcubic graph G distinct from K3,3 satisfies qB(G) ≤ 6, and that this bound is best possible.
Moreover, we provide a complete characterization of the subcubic graphs for which equality holds.
Related Results
Injective edge-coloring of subcubic graphs
Injective edge-coloring of subcubic graphs
An injective edge-coloring [Formula: see text] of a graph [Formula: see text] is an edge-coloring such that if [Formula: see text], [Formula: see text], and [Formula: see text] are...
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
An edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses ...
Rainbow connection number of Cm o Pn and Cm o Cn
Rainbow connection number of Cm o Pn and Cm o Cn
Let <em>G </em>= (<em>V</em>(<em>G</em>),<em>E</em>(<em>G</em>)) be a nontrivial connected graph. A rainbow path is a pa...
BILANGAN STRONG RAINBOW CONNECTION UNTUK GRAF GARIS, GRAF MIDDLE DAN GRAF TOTAL
BILANGAN STRONG RAINBOW CONNECTION UNTUK GRAF GARIS, GRAF MIDDLE DAN GRAF TOTAL
Abstrak. Misalkan G = (V (G); E(G)) adalah suatu graf terhubung tak trivial. Denisipewarnaan c : E(G) ! f1; 2; ; kg; k 2 N, dimana dua sisi yang bertetanggaboleh berwarna sama. ...
On Rainbow Antimagic Coloring of Joint Product of Graphs
On Rainbow Antimagic Coloring of Joint Product of Graphs
Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for ...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Navigating Rainbow Parenthood At Work: An Exploration Of The Work Experiences And Changing Identities Of Rainbow Parents – A Qualitative Study
Navigating Rainbow Parenthood At Work: An Exploration Of The Work Experiences And Changing Identities Of Rainbow Parents – A Qualitative Study
<p dir="ltr"><b>Abstract New Zealand’s society has and continues to evolve, leading to more inclusive definitions of the concept of family. Over the past two decades, i...
Rainbow trout in the inlet tributaries of Lake Chinishibetsu, Shiretoko Peninsula
Rainbow trout in the inlet tributaries of Lake Chinishibetsu, Shiretoko Peninsula
AbstractRainbow trout, Oncorhynchusmykiss, is one of the most widely introduced fish species in the world, and its impacts on native fishes and ecosystems are of considerable conce...