z-logo
Premium
Even cycle decompositions of complete graphs minus a 1‐factor
Author(s) -
Alspach Brian,
Marshall Susan
Publication year - 1994
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.3180020607
Subject(s) - mathematics , combinatorics , factor (programming language) , graph , order (exchange) , discrete mathematics , computer science , finance , economics , programming language
Some sufficient conditions are proven for the complete graph of even order with a 1‐factor removed to be decomposable into even length cycles. © 1994 John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom