Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,719 papers from all fields of science
Search
Sign In
Create Free Account
Graph factorization
Known as:
Graph factor
, 1-factorization conjecture
, 1-factorable
Expand
In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Anthony Hilton
Cycle (graph theory)
Edge coloring
Hall's marriage theorem
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Proof of the 1-factorization and Hamilton Decomposition Conjectures
Béla Csaba
,
D. Kuhn
,
A. Lo
,
Deryk Osthus
,
Andrew Treglown
2014
Corpus ID: 29785347
We prove the following results (via a unified approach) for all sufficiently large n: (i) [1 -factorization conjecture…
Expand
Review
2014
Review
2014
The Concept of eHealth Literacy and Its Measurement
R. Soellner
,
Stefan Huber
,
M. Reder
J. Media Psychol. Theor. Methods Appl.
2014
Corpus ID: 43016081
The objective of this study was to translate the eHealth Literacy Scale (eHEALS) into German, to evaluate this translation…
Expand
Highly Cited
2009
Highly Cited
2009
Multi-temporal soil erosion risk assessment in N. Chalkidiki using a modified USLE raster model.
I. Gitas
,
K. Douros
,
C. Minakou
,
G. N. Silleos
,
C. Karydas
2009
Corpus ID: 8290115
The aim of this work was to test a modified version of the Universal Soil Loss Equation (USLE) for assessing the risks of erosion…
Expand
Highly Cited
2009
Highly Cited
2009
The impact of designing and evaluating molecular animations on how well middle school students understand the particulate nature of matter
Hsin‐Yi Chang
,
C. Quintana
,
J. Krajcik
2009
Corpus ID: 256988
In this study, we investigated whether the understanding of the particulate nature of matter by students was improved by allowing…
Expand
Highly Cited
2006
Highly Cited
2006
A Revised 10-Item Version of The Achievement Motives Scale: Psychometric Properties in German-Speaking Samples
Jonas W. B. Lang
,
Stefan Fries
2006
Corpus ID: 4508774
The Achievement Motives Scale (AMS) is a well-established and frequently used scale to assess hope of success and fear of failure…
Expand
Highly Cited
2001
Highly Cited
2001
Cycle Decompositions of Kn and Kn-I
B. Alspach
,
H. Gavlas
Journal of combinatorial theory. Series B (Print)
2001
Corpus ID: 42982429
We establish necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even…
Expand
Highly Cited
1999
Highly Cited
1999
Soil nitrogen dynamics and relationships with maize yields in a gliricidia–maize intercrop in Malawi
S. Ikerra
,
J. Maghembe
,
P. Smithson
,
R. Buresh
Plant and Soil
1999
Corpus ID: 25666740
Many soils of southern Africa are severely N deficient, but inorganic fertilizers are unaffordable for most subsistence farmers…
Expand
Highly Cited
1997
Highly Cited
1997
Assessment of Psychopathy in a Population of Incarcerated Adolescent Offenders
J. R. Brandt
,
W. Kennedy
,
C. Patrick
,
J. Curtin
1997
Corpus ID: 1716751
The reliability, validity, and factor structure of a modified version of the Psychopathy ChecklistRevised (PCL-R) for adolescents…
Expand
Highly Cited
1989
Highly Cited
1989
The Oberwolfach problem and factors of uniform odd length cycles
B. Alspach
,
P. Schellenberg
,
Douglas R Stinson
,
D. Wagner
Journal of combinatorial theory. Series A
1989
Corpus ID: 27021027
Highly Cited
1973
Highly Cited
1973
Algorithms for constructing graphs and digraphs with given valences and factors
D. Kleitman
,
Danielle Wang
Discrete Mathematics
1973
Corpus ID: 204983703
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE