Name
Abstract | ||
|---|---|---|
An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Jackson and Yoshimoto showed that if G is a 3-edge-connected graph with |G| >= 5 and v is a vertex with degree 3, then G has an even factor F containing two given edges incident with v in which each component has order at least 5. We prove that this theorem is satisfied for each pair of adjacent edges. Also, we show that each 3-edge-connected graph has an even factor F containing two given edges e and f such that every component containing neither e nor f has order at least 5. But we construct infinitely many 3-edge-connected graphs that do not have an even factor F containing two arbitrary prescribed edges in which each component has order at least 5. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.7151/dmgt.2082 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
3-edge-connected graph,2-edge-connected graph,even factor,component | Graph,Discrete mathematics,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 2 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nastaran Haghparast | 1 | 0 | 1.35 |
| Dariush Kiani | 2 | 26 | 5.86 |