Premium
On a problem of a. kotzig concerning factorizations of 4‐regular graphs
Author(s) -
Zelinka Bohdan
Publication year - 1984
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.3190080212
Subject(s) - mathematics , combinatorics , disjoint sets , discrete mathematics , property (philosophy) , hamiltonian path , cograph , graph , chordal graph , 1 planar graph , philosophy , epistemology
The paper gives a solution of a problem of A. Kotzǐg. This problem concerns the 4‐regular graphs G with the property that in every decomposition of G into two edge‐disjoint 2‐regular factors at least one factor is a Hamiltonian circuit in G .
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