OpenAlex | Constrained colouring and σ-hypergraphs

Constrained colouring and σ-hypergraphs

Work

Year: 2015

Type: article

Abstract: A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices wi... more

Source: Discussiones Mathematicae Graph Theory

Authors Yair Caro, Josef Lauri, Christina Zarb

Institutions Oranim Academic College of Education, University of Haifa, University of Malta

Cites: 12

Cited by: 7

Related to: 10

FWCI: 0.516

Citation percentile (by year/subfield): 49.79

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond