Perfect codes and two-graphs
Jan Kratochvíl (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Jan Kratochvíl (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Jan Kratochvíl (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
I. Dvořáková-Rulićová (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Jan Kratochvíl (1985)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A. Nosálová (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Igor E. Zverovich (2006)
Discussiones Mathematicae Graph Theory
Similarity:
We solve Open Problem (xvi) from Perfect Problems of Chvátal [1] available at ftp://dimacs.rutgers.edu/pub/perfect/problems.tex: Is there a class C of perfect graphs such that (a) C does not include all perfect graphs and (b) every perfect graph contains a vertex whose neighbors induce a subgraph that belongs to C? A class P is called locally reducible if there exists a proper subclass C of P such that every graph in P contains a local subgraph...