Results 81 to 90 of about 351 (173)

On 2-Colorability Problem for Hypergraphs with P_8-free Incidence Graphs

open access: yesThe 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

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

open access: yes, 2014
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of Barak et. al. [FOCS 2012]) and the techniques pro-posed by Dinur and Guruswami [FOCS 2013] to incorporatethis code for ...
Håstad, Johan,   +9 more
core   +1 more source

Graphs of groups on surfaces: interactions and models

open access: yes, 2001
The book, suitable as both an introductory reference and as a text book in the rapidly growing field of topological graph theory, models both maps (as in map-coloring problems) and groups by means of graph imbeddings on sufaces.
White, AT, White, Arthur T.
core  

Phase transitions in the $q$-coloring of random hypergraphs

open access: yes, 2017
31 pages, 7 figuresWe study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied.
Dani, Varsha   +7 more
core   +1 more source

ASPECTS OF TOPOLOGICAL APPROACHES FOR DATA SCIENCE. [PDF]

open access: yesFound Data Sci, 2022
Grbić J, Wu J, Xia K, Wei GW.
europepmc   +1 more source

What makes a reaction network "chemical"? [PDF]

open access: yesJ Cheminform, 2022
Müller S, Flamm C, Stadler PF.
europepmc   +1 more source

Conflict-free colorings of graphs and hypergraphs Probability and Computing

open access: yes, 2009
A colouring of the vertices of a hypergraph H is called conflict-free if each hyperedge E of H contains a vertex of 'unique' colour that does not get repeated in E. The smallest number of colours required for such a colouring is called the conflict-free chromatic number of H, and is denoted by chi(CF)(H).
Pach, J., Tardos, G.
openaire   +1 more source

Equipartite colorings in graphs and hypergraphs

open access: yesJournal of Combinatorial Theory, Series B, 1977
Claude Berge 0001, F. Sterboul
openaire   +2 more sources

A study of cluster hypergraphs and its properties. [PDF]

open access: yesSoc Netw Anal Min, 2021
Maity A   +4 more
europepmc   +1 more source

Coloring and constructing (hyper)graphs with restrictions [PDF]

open access: yes, 2015
We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have few edges.
Reiniger, Benjamin M
core  

Home - About - Disclaimer - Privacy