Edge-connectivity and edges of even factors of graphs
From MaRDI portal
Publication:1717189
DOI10.7151/DMGT.2082zbMath1404.05168OpenAlexW2801679441WikidataQ129925806 ScholiaQ129925806MaRDI QIDQ1717189
Nastaran Haghparast, Dariush Kiani
Publication date: 7 February 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2082
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (3)
A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Spectral radius conditions for fractional \([a,b\)-covered graphs] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors]
Cites Work
- Unnamed Item
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- Even factor of bridgeless graphs containing two specified edges
- Path and cycle factors of cubic bipartite graphs
- Spanning even subgraphs of 3‐edge‐connected graphs
- A Note on Sub-Eulerian Graphs
- Eulerian subgraphs containing given edges
This page was built for publication: Edge-connectivity and edges of even factors of graphs