Results 21 to 30 of about 33,621 (316)
Regular inference as vertex coloring [PDF]
Theoretical Computer Science, 2012 This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA consistent with the data (regular inference).We solve this problem by translating it in its entirety to a vertex coloring problem.
Costa Florêncio, C., Verwer, S.
openaire +5 more sources
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic
Contemporary Mathematics and Applications (ConMathA), 2022 The graph in this paper is a simple and connected graph with V(G) is vertex set and E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of ...
Arika Indah Kristiana +2 more
doaj +1 more source
AVD edge-colorings of cubic Halin graphs
AIMS Mathematics, 2023 The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors.
Ningge Huang , Lily Chen
doaj +1 more source
ON LOCAL IRREGULARITY OF THE VERTEX COLORING OF THE CORONA PRODUCT OF A TREE GRAPH
Ural Mathematical Journal, 2022 Let \(G=(V,E)\) be a graph with a vertex set \(V\) and an edge set \(E\). The graph \(G\) is said to be with a local irregular vertex coloring if there is a function \(f\) called a local irregularity vertex coloring with the properties: (i) \(l:(V(G ...
Arika Indah Kristiana +5 more
doaj +1 more source
Edge Coloring Of Complement Bipolar Fuzzy Graphs
Ratio Mathematica, 2023 : Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems.
S. Yahya Mohamed, Subashini N
doaj +1 more source
Dynamic Algorithms for Graph Coloring [PDF]
, 2017 We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(\Delta+1)$- vertex coloring and $(2\Delta-1)$-edge coloring ...
Bhattacharya, Sayan +3 more
core +2 more sources
Bounded vertex colorings of graphs
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julio Kuplinsky +2 more
openaire +2 more sources
Scheduling Problems and Generalized Graph Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, andsimplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for whichwe give a deletion-contraction ...
John Machacek
doaj +1 more source
Nonrepetitive vertex colorings of graphs
Discrete Mathematics, 2011 AbstractWe prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the facial Thue chromatic number of a plane graph in terms of its maximum degree.
Jochen Harant, Stanislav Jendrol′
openalex +3 more sources
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Let $G$ be a graph and $\mathcal{S}$ be a subset of $Z$. A vertex-coloring $\mathcal{S}$-edge-weighting of $G$ is an assignment of weights by the elements of $\mathcal{S}$ to each edge of $G$ so that adjacent vertices have different sums of incident ...
Hongliang Lu
doaj +1 more source