Results 51 to 60 of about 142 (135)
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey [PDF]
, 2006 The current situation with bounds on the smallest number of edges in color-critical graphs and hypergraphs is discussed.
openaire +1 more source
On 2-Colorability Problem for Hypergraphs with P_8-free Incidence Graphs
The International Arab Journal of Information Technology, 2019 A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. The hypergraph 2- Coloring Problem is the question whether a given hypergraph is 2-colorable. It is known that deciding the 2-colorability of hypergraphs is NP-complete even for hypergraphs whose hyperedges have size at most 3.
openaire +1 more source
ASPECTS OF TOPOLOGICAL APPROACHES FOR DATA SCIENCE. [PDF]
Found Data Sci, 2022 Grbić J, Wu J, Xia K, Wei GW.
europepmc +1 more source
What makes a reaction network "chemical"? [PDF]
J Cheminform, 2022 Müller S, Flamm C, Stadler PF.
europepmc +1 more source
Coloring geometric hyper-graph defined by an arrangement of half-planes [PDF]
, 2010 We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
openaire +2 more sources
A study of cluster hypergraphs and its properties. [PDF]
Soc Netw Anal Min, 2021 Maity A +4 more
europepmc +1 more source
Equipartite colorings in graphs and hypergraphs
Journal of Combinatorial Theory, Series B, 1977 Claude Berge 0001, F. Sterboul
openaire +1 more source
Solution of road network problem with the help of m-polar fuzzy graph using isometric and antipodal concept. [PDF]
Sci Rep, 2023 Mondal U, Mahapatra T, Xin Q, Pal M.
europepmc +1 more source
Graph-Based Resource Allocation for Integrated Space and Terrestrial Communications. [PDF]
Sensors (Basel), 2022 Ivanov A +4 more
europepmc +1 more source
Perfect sampling from spatial mixing. [PDF]
Random Struct Algorithms, 2022 Feng W, Guo H, Yin Y.
europepmc +1 more source