The existence problem for colour critical linear hypergraphs

1978 ◽  
Vol 32 (3-4) ◽  
pp. 273-282 ◽  
Author(s):  
H. L. Abbott ◽  
A. C. Liu
Keyword(s):  
Existence Problem ◽  
Linear Hypergraphs

scholarly journals Intersection Graphs of k-uniform Linear Hypergraphs

1982 ◽  
Vol 3 (2) ◽  
pp. 159-172 ◽  
Author(s):  
Ranjan N. Naik ◽  
S.B. Rao ◽  
S.S. Shrikhande ◽  
N.M. Singhi
Keyword(s):  
Intersection Graphs ◽  
Linear Hypergraphs

scholarly journals On the existence problem of the total domination vertex critical graphs

2011 ◽  
Vol 159 (1) ◽  
pp. 46-52 ◽  
Author(s):  
Moo Young Sohn ◽  
Dongseok Kim ◽  
Young Soo Kwon ◽  
Jaeun Lee
Keyword(s):  
Existence Problem ◽  
Total Domination ◽  
Critical Graphs

scholarly journals Some Results on Chromaticity of Quasi-Linear Paths and Cycles

10.37236/2370 ◽  
2012 ◽  
Vol 19 (2) ◽  
Author(s):  
Ioan Tomescu
Keyword(s):  
Linear Hypergraphs

Let $r\geq 1$ be an integer. An $h$-hypergraph $H$ is said to be $r$-quasi-linear (linear for $r=1$) if any two edges of $H$ intersect in 0 or $r$ vertices. In this paper it is shown that $r$-quasi-linear paths $P_{m}^{h,r}$ of length $m\geq 1$ and cycles $C_{m}^{h,r}$ of length $m\geq 3$ are chromatically unique in the set of $h$-uniform $r$-quasi-linear hypergraphs provided $r\geq 2$ and $h\geq 3r-1$. 

Constructive Packings by Linear Hypergraphs

2013 ◽  
Vol 22 (6) ◽  
pp. 829-858 ◽  
Author(s):  
JILL DIZONA ◽  
BRENDAN NAGLE
Keyword(s):  
Maximum Size ◽  
Np Hard ◽  
Edge Disjoint ◽  
Analogous Algorithm ◽  
Linear Hypergraphs

For k-graphs F0 and H, an F0-packing of H is a family $\mathscr{F}$ of pairwise edge-disjoint copies of F0 in H. Let νF0(H) denote the maximum size |$\mathscr{F}$| of an F0-packing of H. Already in the case of graphs, computing νF0(H) is NP-hard for most fixed F0 (Dor and Tarsi [6]).In this paper, we consider the case when F0 is a fixed linear k-graph. We establish an algorithm which, for ζ > 0 and a given k-graph H, constructs in time polynomial in |V(H)| an F0-packing of H of size at least νF0(H) − ζ |V(H)|k. Our result extends one of Haxell and Rödl, who established the analogous algorithm for graphs.

On the existence problem for localized acoustic waves on the interface between two piezocrystals

Wave Motion ◽  
1994 ◽  
Vol 20 (3) ◽  
pp. 233-244 ◽  
Author(s):  
V.I. Alshits ◽  
D.M. Barnett ◽  
A.N. Darinskii ◽  
J. Lothe
Keyword(s):  
Acoustic Waves ◽  
Existence Problem

Application of Multirate Filter Bank to the Co-Existence Problem of DS-CDMA and TDMA Systems

1996 ◽  
pp. 409-412
Author(s):  
Shinsuke Hara ◽  
Takahiro Matsuda ◽  
Norihiko Morinaga
Keyword(s):  
Filter Bank ◽  
Existence Problem
Sign in / Sign up

Export Citation Format

Share Document