Results 31 to 40 of about 39,087 (298)
Properly colored cycles in edge-colored graphs [PDF]
, 2018 An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC cycle for short ) is a cycle such that consecutive edges are assigned distinct colors.
Li, Ruonan
core +1 more source
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors.
Marthe Bonamy +2 more
doaj +1 more source
Local edge (a, d) –antimagic coloring on sunflower, umbrella graph and its application
Alifmatika, 2023 Suppose a graph G = (V, E) is a simple, connected and finite graph with vertex set V(G) and an edge set E(G). The local edge antimagic coloring is a combination of local antimagic labelling and edge coloring.
Robiatul Adawiyah +2 more
doaj +1 more source
Compatible spanning circuits in edge-colored graphs [PDF]
, 2020 A compatible spanning circuit in a (not necessarily properly) edge-colored graph G is a closed trail containing all vertices of G in which any two consecutively traversed edges have distinct colors.
Guo, Zhiwei +3 more
core +3 more sources
Fractional Q-Edge-Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2013 An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj +1 more source
On paths, trails and closed trails in edge-colored graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Laurent Gourvès +3 more
doaj +1 more source
Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs [PDF]
, 2020 It is conjectured that every edge-colored complete graph (Formula presented.) on (Formula presented.) vertices satisfying (Formula presented.) contains (Formula presented.) vertex-disjoint properly edge-colored cycles.
Broersma, Hajo; id_orcid +6 more
core +1 more source
The Proper Diameter of a Graph
Discussiones Mathematicae Graph Theory, 2020 A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A path is properly colored if consecutive edges have distinct colors, and an edge-colored graph is properly connected if there exists a properly colored path
Coll Vincent +4 more
doaj +1 more source
On the simultaneous edge coloring of graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2014 A μ-simultaneous edge coloring of graph G is a set of μ proper edge colorings of G with a same color set such that for each vertex, the sets of colors appearing on the edges incident to that vertex are the same in each coloring and no edge receives the same color in any two colorings.
Behrooz Bagheri Gh., Behnaz Omoomi
openaire +3 more sources
Ars Mathematica Contemporanea, 2015 An edge coloring of a graph G is said to be an odd edge coloring if for each vertex v ofG and each colorc, the vertexv uses the colorc an odd number of times or does not use it at all. In [5], Pyber proved that 4 colors suffice for an odd edge coloring of any simple graph.
Borut Luzar +2 more
openaire +3 more sources