Premium
Cross‐intersecting couples of graphs
Author(s) -
Fachini Emanuela,
Körner János
Publication year - 2007
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20252
Subject(s) - combinatorics , mathematics , vertex (graph theory) , split graph , graph , complement (music) , clique , discrete mathematics , block graph , pathwidth , line graph , biochemistry , chemistry , complementation , gene , phenotype
Two graphs on the same vertex set form a cross‐intersecting couple if they have a pair of clique coverings with the property that every pair of cliques from the respective coverings intersect. In particular, a graph is called normal if it forms a cross‐intersecting couple with its complement. We determine the largest size of families of graphs every pair of which forms a cross‐intersecting couple under various additional restrictions. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 105–112, 2007
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom