Results 21 to 30 of about 11,475 (265)
Exact square coloring of graphs resulting from some graph operations and products
AKCE International Journal of Graphs and Combinatorics, 2022 A vertex coloring of a graph [Formula: see text] is called an exact square coloring of G if any pair of vertices at distance 2 receive distinct colors.
Priyamvada, B. S. Panda
doaj +1 more source
Coloring problem of signed interval graphs [PDF]
Transactions on Combinatorics, 2019 A signed graph $(G,\sigma)$ is a graph together with an assignment of signs $\{+,-\}$ to its edges where $\sigma$ is the subset of its negative edges.
Farzaneh Ramezani
doaj +1 more source
DRAT and Propagation Redundancy Proofs Without New Variables [PDF]
Logical Methods in Computer Science, 2021 We study the complexity of a range of propositional proof systems which allow inference rules of the form: from a set of clauses $\Gamma$ derive the set of clauses $\Gamma \cup \{ C \}$ where, due to some syntactic condition, $\Gamma \cup \{ C \}$ is ...
Sam Buss, Neil Thapen
doaj +1 more source
Triangulated Spheres and Colored Cliques [PDF]
Discrete & Computational Geometry, 2002 \textit{R. Aharoni} and \textit{P. Haxell} [J. Graph Theory 35, 83-88 (2000; Zbl 0956.05075)] proved a generalization of Hall's theorem which concerns families of sets, to families of hypergraphs. \textit{R. Meshulam} [The clique complex and hypergraph matching, Combinatorica 21(1), 89-94 (2001)] proved an extension of this result, using homology and ...
Aharoni, Ron +2 more
openaire +2 more sources
On Several Parameters of Super Line Graph
Axioms, 2023 The super line graph of index r, denoted by Lr(G), is defined for any graph G with at least r edges. Its vertices are the sets of r edges of G, and two such sets are adjacent if an edge of one is adjacent to an edge of the other.
Jiawei Meng +2 more
doaj +1 more source
Graph coloring with physics-inspired graph neural networks
Physical Review Research, 2022 We show how graph neural networks can be used to solve the canonical graph coloring problem. We frame graph coloring as a multiclass node classification problem and utilize an unsupervised training strategy based on the statistical physics Potts model ...
Martin J. A. Schuetz +3 more
doaj +1 more source
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
Algorithms, 2020 Let G=(V,E) be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu search algorithm for
Derek H. Smith +2 more
doaj +1 more source
A feasible interpolation for random resolution [PDF]
Logical Methods in Computer Science, 2017 Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen clauses (modulo ...
Jan Krajicek
doaj +1 more source
An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries
Applied Sciences, 2022 In combinatorial optimization, the more complex a problem is, the more challenging it becomes, usually causing most research to focus on creating solvers for larger cases.
Jose Torres-Jimenez +3 more
doaj +1 more source
Between Treewidth and Clique-width [PDF]
, 2014 Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width.
B Courcelle +12 more
core +1 more source