Extremal problems involving neighborhood unions

DOI10.1002/JGT.3190110413zbMath0659.05058OpenAlexW2058551872MaRDI QIDQ3808117

Michael S. Jacobson, Ronald J. Gould, Ralph J. Faudree, Richard H. Schelp

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110413

zbMATH Keywords

cyclematchingpath1-factorneighborhood unions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ Lower bounds of length of longest cycles in graphs involving neighborhood unions ⋮ Longest cycles in 3-connected graphs ⋮ Neighbourhood unions and Hamiltonian properties in graphs ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ On a neighborhood condition implying the existence of disjoint complete graphs ⋮ Spanning paths in graphs ⋮ Neighborhood conditions and edge-disjoint perfect matchings ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ A neighborhood condition which implies the existence of a complete multipartite subgraph ⋮ Neighborhood unions and a generalization of Dirac's theorem

Cites Work

• Hamiltonian paths in oriented graphs
• Perfect matchings of a graph

This page was built for publication: Extremal problems involving neighborhood unions