Graph decompositions without isolated vertices III

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199702)24:2<155::AID-JGT3>3.0.CO;2-P" /><155::AID-JGT3>3.0.CO;2-P 10.1002/(SICI)1097-0118(199702)24:2<155::AID-JGT3>3.0.CO;2-PzbMath0863.05066OpenAlexW2075609919MaRDI QIDQ4333457

Hikoe Enomoto, Shinsuke Matsunaga

Publication date: 8 April 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199702)24:2<155::aid-jgt3>3.0.co;2-p

zbMATH Keywords

minimum degree

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Graph factors and factorization: 1985--2003: a survey ⋮ Partitions of a graph into paths with prescribed endvertices and lengths ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs

This page was built for publication: Graph decompositions without isolated vertices III