Partial Degree Conditions and Cycle Coverings
From MaRDI portal
Publication:4982290
DOI10.1002/jgt.21807zbMath1309.05109OpenAlexW1931135130MaRDI QIDQ4982290
Publication date: 24 March 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21807
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Partial degree conditions and cycle coverings in bipartite graphs, Disjoint cycles covering specified vertices in bipartite graphs with partial degrees, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Disjoint cycles with partial degree conditions in claw-free graphs
Cites Work
- Edge disjoint placement of graphs
- On the maximum number of independent cycles in a graph
- Independent cycles with limited size in a graph
- On the maximum number of independent cycles in a bipartite graph
- 2‐neighborhoods and hamiltonian conditions
- Embedding Arbitrary Graphs of Maximum Degree Two
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs