Results 21 to 30 of about 39,087 (298)
Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs [PDF]
, 2023 We present new sharp sufficient conditions for the existence of properly colored and rainbow (Formula presented.) 's in edge-colored graphs. Our first results deal with sharp color neighborhood conditions for the existence of properly colored (Formula ...
Binlong Li +7 more
core +1 more source
Representations of Edge Intersection Graphs of Paths in a Tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic +2 more
doaj +1 more source
Local edge coloring of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge coloring c to an edge of G is called the value of c and is denoted by The local edge chromatic number of ...
P. Deepa +2 more
openaire +2 more sources
Edge‐colored complete graphs without properly colored even cycles: A full characterization [PDF]
, 2021 The structure of edge-colored complete graphs containing no properly colored triangles has been characterized by Gallai back in the 1960s. More recently, Cǎda et al. and Fujita et al.
Broersma, Hajo; id_orcid +7 more
core +1 more source
The Vertex-Rainbow Connection Number of Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same.
Li Hengzhe, Ma Yingbin, Li Xueliang
doaj +1 more source
Edge Bundling Method Based on Homologous Control Points [PDF]
Jisuanji kexue, 2022 Edge bundling is an effective method to reduce the visual clutter caused by the visualization of the node-link diagram with a large number of complex connections.Generally,the edge bundling based on spatial proximity will lead to independent edge ...
LIU Meng-xin, ZHANG Fan, LI Tian-rui
doaj +1 more source
Maximum edge-colorings of graphs
Discussiones Mathematicae Graph Theory, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stanislav Jendrol', Michaela Vrbjarová
openaire +2 more sources
Edge coloring signed graphs [PDF]
Discrete Mathematics, 2020 31 pages, 13 ...
openaire +2 more sources
On twin edge colorings of graphs
Discussiones Mathematicae Graph Theory, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eric Andrews +4 more
openaire +2 more sources
Exploring Relationship Between Traditional Lattices and Graph Lattices of Topological Coding
Jisuanji kexue yu tansuo, 2021 It is known that there are no polynomial quantum algorithms to solve some lattice difficult problems. Uncolored graphic lattice and colored graphic lattice are the products of multidisciplinary intersection inspired by lattice theory. A uncolored graphic
ZHANG Mingjun, YANG Sihua, YAO Bing
doaj +1 more source