Results 21 to 30 of about 351 (173)

Graph Set-colorings And Hypergraphs In Topological Coding

open access: yesCoRR, 2022
In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will introduce set-colored graphs admitting set-colorings that has been considerable cryptanalytic significance, and ...
Bing Yao, Fei Ma 0007
openaire   +2 more sources

Coloring bipartite graphs with semi-small list size [PDF]

open access: yes, 2023
Recently, Alon, Cambie, and Kang introduced asymmetric list coloring of bipartite graphs, where the size of each vertex's list depends on its part. For complete bipartite graphs, we fix the list sizes of one part and consider the resulting asymptotics ...
Zhu, Daniel G., Daniel G. Zhu
core   +1 more source

Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures [PDF]

open access: yes, 2022
This thesis mainly focus on complexity results of the generalized version of the $r$-Coloring Problem, the $r$-Pre-Coloring Extension Problem and the List $r$-Coloring Problem restricted to hypergraphs and ordered graphs with forbidden substructures ...
Li, Yanjia
core  

Anti-Ramsey problems on graphs and hypergraphs [PDF]

open access: yes, 2022
The Tur\'{a}n number for a graph $H$ is the least possible number of edges on an $n$-vertex graph with no copy of $H$ as a subgraph. For graphs $G$ and $H$, the \emph{anti-Ramsey number}, denoted $\ar(G,H)$, is the minimum number of colors $d$ such that
Sprangel, Elizabeth Ann
core   +1 more source

Graphs with coloring redundant edges

open access: yesElectronic Journal of Graph Theory and Applications, 2016
A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges.
Bart Demoen, Phuong-Lan Nguyen
doaj   +1 more source

Matchings with few colors in colored complete graphs and hypergraphs

open access: yesDiscrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
András Gyárfás, Gábor N. Sárközy
openaire   +2 more sources

The Min-Max Edge q-Coloring Problem

open access: yesJournal of Graph Algorithms and Applications, 2015
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q.
Tommi Larjomaa, Alexandru Popa
doaj   +1 more source

Bounded colorings of multipartite graphs and hypergraphs

open access: yesEuropean Journal of Combinatorics, 2017
Let $c$ be an edge-coloring of the complete $n$-vertex graph $K_n$. The problem of finding properly colored and rainbow Hamilton cycles in $c$ was initiated in 1976 by Bollobás and Erd\H os and has been extensively studied since then. Recently it was extended to the hypergraph setting by Dudek, Frieze and Ruciński.
Nina Kamcev, Benny Sudakov, Jan Volec
openaire   +5 more sources

Coloring clique hypergraphs [PDF]

open access: yes, 2000
Let G = (V, E) be a simple graph. The clique hypergraph of G, denoted as CH( G), has V as its set of vertices, and the maximal cliques as its hyperedges. Let Sk be a set of k colors.
Poon, Hoifung
core   +1 more source

Graph Entropy Based on Strong Coloring of Uniform Hypergraphs

open access: yesAxioms, 2021
The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems. Being different from the classical graph entropy, we extend this concept to a hypergraph.
Fang, Lusheng   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy