Results 1 to 10 of about 6,626,501 (294)
On the total and AVD-total coloring of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and ...
B. S. Panda, Shaily Verma, Yash Keerti
doaj +3 more sources
Total Coloring and Total Matching: Polyhedra and Facets [PDF]
European Journal of Operational Research, 2022 A total coloring of a graph $G = (V, E)$ is an assignment of colors to vertices and edges such that neither two adjacent vertices nor two incident edges get the same color, and, for each edge, the end-points and the edge itself receive different colors.
Luca Ferrarini, Stefano Gualandi
openaire +5 more sources
Total dominator total coloring of a graph [PDF]
Contributions to Discrete Mathematics, 2023 Here, we initiate to study the total dominator total coloring of a graph which is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. In more details, while in section 2 we present some tight lower and upper bounds for the total dominator total chromatic number of a graphs in ...
Adel P. Kazemi +2 more
core +5 more sources
Fuzzy coloring and total fuzzy coloring of various types of intuitionistic fuzzy graphs [PDF]
Notes on IFS, 2023 In this paper, fuzzy coloring and total fuzzy coloring of intuitionistic fuzzy graphs are introduced. The fuzzy chromatic number, fuzzy chromatic index, total fuzzy chromatic number and total fuzzy chromatic index of both vertices and edges in ...
R. Buvaneswari, P. Revathy
doaj +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2023 The smallest integer k needed for the assignment of k colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph.
Jayabalan Geetha +2 more
doaj +4 more sources
Generalized Fractional Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let P and Q be additive and hereditary graph properties and let r, s be integers such that r ≥ s. Then an r/s -fractional (P,Q)-total coloring of a finite graph G = (V,E) is a mapping f, which assigns an s-element subset of the set {1, 2, . . .
Karafová Gabriela, Soták Roman
doaj +4 more sources
Total fuzzy graph coloring [PDF]
Journal of Hyperstructures, 2023 In this paper, a hybrid genetic algorithm (HGA) is proposed for the total fuzzy graph coloring (TFGC) problem. TFGC comprises of a graph with fuzzy vertices and edges, seeks to obtain an optimal $k-$coloring of that fuzzy graph such that the degree of ...
Smriti Saxena +2 more
doaj +1 more source
On total coloring and equitable total coloring of infinite snark families
RAIRO - Operations Research, 2023 We show that all members of the SemiBlowup, Blowup and the first Loupekine snark families have equitable total chromatic number equal to 4. These results provide evidence of negative answers for the questions proposed: by (A. Cavicchioli, T.E. Murgolo, B. Ruini and F. Spaggiari, Acta Appl. Math.
Miguel A. D. R. Palma +3 more
openaire +3 more sources
Equitable Total Coloring of Corona of Cubic Graphs
Discussiones Mathematicae Graph Theory, 2021 The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the total chromatic number of G, denoted by X′(G). If the di erence between cardinalities of any two total independent sets is at most one, then the minimum ...
Furmańczyk Hanna, Zuazua Rita
doaj +1 more source
Total Equitable List Coloring [PDF]
Graphs and Combinatorics, 2018 An equitable coloring is a proper coloring of a graph such that the sizes of the color classes differ by at most one. A graph $G$ is equitably $k$-colorable if there exists an equitable coloring of $G$ which uses $k$ colors, each one appearing on either $\lfloor |V(G)|/k \rfloor$ or $\lceil |V(G)|/k \rceil$ vertices of $G$. In 1994, Fu conjectured that
Hemanshu Kaul +2 more
openaire +4 more sources