Graph decompositions without isolated vertices

DOI10.1006/JCTB.1995.1007MaRDI QIDQ1892833zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Graph decompositions without isolated vertices. II
• Graph decompositions without isolates
• Graph decompositions without isolated vertices III

Cited in

(8)

• Almost-spanning subgraphs with bounded degree in dense graphs
• Graph decompositions without isolated vertices III
• scientific article; zbMATH DE number 1744069 (Why is no real title available?)
• Partitions of a graph into paths with prescribed endvertices and lengths
• scientific article; zbMATH DE number 2188395 (Why is no real title available?)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Graph decompositions without isolates
• Graph factors and factorization: 1985--2003: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892833)