Results 41 to 50 of about 58,831 (310)
A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
Axioms, 2022 Let G be a graph with a minimum degree δ of at least two. The inclusion chromatic index of G, denoted by χ⊂′(G), is the minimum number of colors needed to properly color the edges of G so that the set of colors incident with any vertex is not contained ...
Lily Chen, Yanyi Li
doaj +1 more source
Coloring decompositions of complete geometric graphs [PDF]
, 2019 A decomposition of a non-empty simple graph $G$ is a pair $[G,P]$, such that $P$ is a set of non-empty induced subgraphs of $G$, and every edge of $G$ belongs to exactly one subgraph in $P$.
Huemer, Clemens +2 more
core +3 more sources
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic subgraph is a forest. A star colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ a (G) and χ s (G)
David R. Wood
doaj +2 more sources
The b-chromatic index of graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Campos +10 more
openaire +2 more sources
Structural Properties of Index Coding Capacity Using Fractional Graph Theory [PDF]
, 2015 The capacity region of the index coding problem is characterized through the notion of confusion graph and its fractional chromatic number. Based on this multiletter characterization, several structural properties of the capacity region are established ...
Arbabjolfaei, Fatemeh, Kim, Young-Han
core +1 more source
Conflict-free chromatic number vs conflict-free chromatic index
, 2020 A vertex coloring of a given graph $G$ is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). The minimum number of colors in such a coloring is the conflict-free chromatic number of $G$, denoted $ _{CF}(G)$. What is the maximum possible conflict-free chromatic number
Dębski, Michał, Przybyło, Jakub
openaire +2 more sources
On the $f$-matching polytope and the fractional $f$-chromatic index
, 2014 Our motivation is the question of how similar the $f$-colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters.
Glock, Stefan
core +1 more source
Electronic Notes in Discrete Mathematics, 2013 Abstract A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to a vertex in each other color class. The b-chromatic number of G is the maximum integer χ b ( G ) for which G has a b-coloring with χ b ( G ) colors.
Carlos Vinícius G.C.Lima +4 more
openaire +2 more sources
Restrained star edge coloring of graphs and its application in optimal & safe storage practices
Ratio Mathematica, 2023 In this paper we introduce the concept of restrained star edge coloring of graphs by restraining the conditions of the star coloring of graphs. The restrained star edge coloring of graphs is a path based graph coloring which is said to be proper if all ...
W. Evangeline Lydia +1 more
doaj +1 more source
Edge chromatic index and edge-sum chromatic index for families of integral sum graphs
, 2023 We consider class of integral sum graphs $H^{-i,s}_{m,j}$ subject to the conditions $-i< ...
R, Priyanka B +2 more
openaire +2 more sources