Premium
Packing of three copies of a graph
Author(s) -
Wang Hong,
Sauer Norbert
Publication year - 1996
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/(sici)1097-0118(199601)21:1<71::aid-jgt10>3.0.co;2-v
Subject(s) - combinatorics , mathematics , graph , line graph , disjoint sets , discrete mathematics
A graph of order n is said to be 3‐placeable if there are three edge‐disjoint copies of this graph in K n . An ( n, n − 1)‐graph is a graph of order n with n − 1 edges. In this paper we characterize all the ( n, n − 1)‐graphs which contain no cycles of length 3 or 4 and which are 3‐placeable. © 1996 John Wiley & Sons, Inc.