Skip to search formSkip to main contentSkip to account menu

Graph factorization

Known as: Graph factor, 1-factorization conjecture, 1-factorable 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A psychometrically sound measurement instrument is crucialy in understanding needed athletes’ psychological profile. Among… 
2015
2015
In the present study, the effect of secondary Radioclimatic variables on radio signals at the troposphere in Nsukka, Nigeria was… 
2009
2009
In this paper, a different manner to analyze a buck converter and how to design its feedback control is proposed. The block… 
2005
2005
We obtain an exact formula for the expected value of the optimum for a certain class of random combinatorial optimization… 
2003
2003
The long-term effect on the development of spruce-fir stands in Maine from various combinations of herbicides (glyphosate… 
1998
1998
The improvement of an integrated aircraft predesign code and its application to future aircraft concepts is reported. For the… 
1994
1994
A graph G is called path-tough, if, for each nonempty set S of vertices, the graph G-S can be covered by at most |S| vertex… 
Highly Cited
1989
Highly Cited
1989
Abstract 
1975
1975
Water content and water potential in stools of three clones of Populus spp. were studied over the dormant period. To determine…