Results 51 to 60 of about 12,413 (296)
On Mf-Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2022 An edge coloring φ of a graph G is called an Mf-edge coloring if | φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v.
Ivančo Jaroslav, Onderko Alfréd
doaj +1 more source
On star and biclique edge‐colorings [PDF]
International Transactions in Operational Research, 2016 AbstractA biclique of G is a maximal set of vertices that induces a complete bipartite subgraph of G with at least one edge, and a star of a graph G is a maximal set of vertices that induces a complete bipartite graph . A biclique (resp. star) edge‐coloring is a coloring of the edges of a graph with no monochromatic bicliques (resp. stars).
Simone Dantas +5 more
openaire +4 more sources
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, 2013 An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each ...
Czap Július, Tuza Zsolt
doaj +1 more source
Improved Edge-Coloring with Three Colors
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On b-vertex and b-edge critical graphs [PDF]
Opuscula Mathematica, 2015 A \(b\)-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the \(b\)-chromatic number \(b(G)\) of a graph \(G\) is the largest integer \(k\) such that \(G ...
Noureddine Ikhlef Eschouf +1 more
doaj +1 more source
Edge Cover Through Edge Coloring
The Electronic Journal of CombinatoricsLet $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned. Clearly $\xi(G) \le \delta(G)$, the minimum degree of $G$.
Guantao Chen, Songling Shan
openaire +1 more source
Locally irregular edge-coloring of subcubic graphs
, 2022 A graph is {\em locally irregular} if no two adjacent vertices have the same degree. A {\em locally irregular edge-coloring} of a graph $G$ is such an (improper) edge-coloring that the edges of any fixed color induce a locally irregular graph.
Maceková, Mária +5 more
core +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem [PDF]
, 2004 A nearly equitable edge-coloring of a multigraph is a coloring such that edges incident to each vertex are colored equitably in number. This problem was solved in O(kn^2) time, where n and k are the numbers of the edges and the colors, respectively.
XIE, Xuzhen +3 more
core
Tight Lower Bounds for List Edge Coloring [PDF]
, 2018 The fastest algorithms for edge coloring run in time 2^m n^{O(1)}, where m and n are the number of edges and vertices of the input graph, respectively. For dense graphs, this bound becomes 2^{Theta(n^2)}.
Kowalik, Lukasz, Socala, Arkadiusz
core +1 more source