z-logo
Premium
A 1‐factorization of the line graphs of complete graphs
Author(s) -
Alspach Brian
Publication year - 1982
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.3190060408
Subject(s) - mathematics , combinatorics , factorization , chordal graph , cograph , indifference graph , 1 planar graph , discrete mathematics , graph , algorithm
A 1‐factorization is constructed for the line graph of the complete graph K n when n is congruent to 0 or 1 modulo 4.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here