Skip to search formSkip to main contentSkip to account menu

Hajós construction

Known as: Hajos construction 
In graph theory, a branch of mathematics, the Hajós construction is an operation on graphs named after György Hajós () that may be used to construct… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Binary operations are in general more difficult to implement when compared with unary operations. Normally any operation on a… 
2014
2014
In this paper, we show that three are many groups which do not possess the Hajos-nProperty. 
2013
2013
The Hajós’ Theorem (Wiss Z Martin Luther Univ Math-Natur Reihe, 10, pp 116–117, 1961) shows a necessary and sufficient condition… 
2013
2013
A classic question in graph theory is: Does a graph with chromatic number d “contain” a complete graph on d vertices in some way… 
2006
2006
In this paper we propose a constructive algorithm using constraint propagation to generate 4-critical graph units (4-CGUs) which… 
2004
2004
s and proceedings published in international journals : Hajós Gy., Gelencsér É., Szerdahelyi E., Bardocz S., Pusztai A… 
2001
2001
Since the initial characterization of cephalostatins in 1988, the bissteroidal pyrazine structure has attracted many synthetic… 
2000
2000
Two routes were evaluated for the preparation of multiply functionalized cyclohexane derivatives in a stereocontrolled fashion…