Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique-Reference-Cited by-同舟云学术

Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique

Published:1994-12 Issue:4 Volume:14 Page:453-461
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Chung Myung S.,West Douglas B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF01302966.pdf

Reference23 articles.

1. B. Alspach, K. Heinrich, andG. Liu: Orthogonal factorizations of graphs, in:Contemporary Design Theory: A collection of Surveys (J. Dinitz and D. Stinson, eds.), (Wiley 1992), 13?40.

2. F. E. Bennet, andL. Wu: On minimum matrix representation of closure operations,Discrete Appl. Math. 26 (1990), 25?40.

3. R. C. Brigham, R. D. Dutton, andF. R. McMorris: On the relationship betweenp-edge andp-vertex clique covers,Vishwa Intl. J. Graph Theory 1 (1992), 133?140.

4. J. Demetrovics, Z. Füredi andG. O. H. Katona: Minimum matrix representation of closure operations,Discrete Appl. Math. 11 (1985), 115?128.

5. N. Eaton, R. J. Gould, andV. Rödl: Onp-intersection representations, preprint.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Kneser Ranks of Random Graphs and Minimum Difference Representations;SIAM Journal on Discrete Mathematics;2018-01

2. Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations;IEEE/ACM Transactions on Networking;2017-10

3. Forbidden induced subgraphs for bounded p-intersection number;Discrete Mathematics;2016-02

4. Intersection Representations of the Complete Bipartite Graph;The Mathematics of Paul Erdős II;2013

5. Overlap number of graphs;Journal of Graph Theory;2011-02-18