On the 1-factors of n-connected graphs
From MaRDI portal
Publication:2546879
DOI10.1016/0095-8956(71)90027-XzbMath0219.05074MaRDI QIDQ2546879
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Construction of k-matchings in graph products, Algorithmic proofs of two relations between connectivity and the 1- factors of a graph, Matching theory -- a sampler: From Dénes König to the present, Pairs of Hamiltonian circuits in 5-connected planar graphs, Some improved bounds on the number of 1-factors of n-connected graphs, Counting 1-factors in infinite graphs, On the number of 1-factors of locally finite graphs, Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
Cites Work