Name
Abstract | ||
|---|---|---|
A spanning subgraph of a graph is called an even factor of if each vertex of has even degree at least 2 in . It was conjectured that if a graph has an even factor, then it has an even factor with , where is the set of vertices of degree 2 in . We note that the conjecture is false if is a triangle. In this paper, we confirm the conjecture for all graphs on at least 4 vertices, and moreover, we prove that if for every even factor of , then every maximum even factor of is a 2-factor consisting of even circuits. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10878-017-0161-x | J. Comb. Optim. |
Keywords | Field | DocType |
Even factor,Spanning subgraph,2-factor,Extremal graph | Discrete mathematics,Graph,Spanning subgraph,Combinatorics,Vertex (geometry),New digraph reconstruction conjecture,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
35 | 1 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Chen | 1 | 285 | 60.83 |
| Genghua Fan | 2 | 412 | 65.22 |