Graph decompositions without isolated vertices

DOI10.1006/JCTB.1995.1007zbMath0834.05046OpenAlexW2012829609MaRDI QIDQ1892833

Hikoe Enomoto

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1007

zbMATH Keywords

partitiongraph decompositionsisolated vertices

Mathematics Subject Classification ID

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

Related Items (4)

Graph factors and factorization: 1985--2003: a survey ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Partitions of a graph into paths with prescribed endvertices and lengths ⋮ Almost-spanning subgraphs with bounded degree in dense graphs

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