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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
0204019712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We present a novel approach to automatic metaphor identification, that discovers both metaphorical associations and metaphorical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2011
2011
Most previous research on verb clustering has focussed on acquiring flat classifications from corpus data, although many manually… (More)
  • figure 1
  • table 2
  • table 1
  • table 3
  • table 4
Is this relevant?
2004
2004
Through Monte Carlo simulation, small sample methods for evaluating overall data-model fit in structural equation modeling were… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstmct We reveal an equivalence relation between the construction of a new class of low density MDS array codes, that we call B… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Using market European option prices, a method for computing a smooth local volatility function in a 1-factor continuous diffusion… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate… (More)
  • table 3.1
  • table 3.2
  • figure 5.1
Is this relevant?
1992
1992
LetG be a connected graph withn vertices andm edges. We develop an algorithm that finds the (unique) prime factors ofG with… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.3
  • figure 4.4
  • figure 4.5
Is this relevant?
1979
1979
1. Introduction It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, l… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?