Graph decompositions without isolated vertices III

DOI10.1002/(SICI)1097-0118(199702)24:2%3C155::AID-JGT3%3E3.0.CO;2-PMaRDI QIDQ4333457zbMATH OpenOpenAlexFDO

Authors 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%3C155::aid-jgt3%3E3.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)

Recommendations

• Graph decompositions without isolated vertices. II
• Graph decompositions without isolated vertices
• scientific article; zbMATH DE number 2188395
• Graph decompositions without isolates
• Decomposition of 3-connected graphs
• scientific article; zbMATH DE number 398946
• scientific article; zbMATH DE number 3974987
• On decomposition of triangle-free graphs under degree constraints
• scientific article; zbMATH DE number 475619
• scientific article; zbMATH DE number 617585

Cited in

(11)

• Graph decomposition with constraints in the minimum degree
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Graph decompositions without isolated vertices. II
• Graph decompositions without isolated vertices
• A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
• Almost regular decompositions of a graph
• Partitions of a graph into paths with prescribed endvertices and lengths
• scientific article; zbMATH DE number 2188395 (Why is no real title available?)
• Graph decompositions without isolates
• Graph factors and factorization: 1985--2003: a survey
• Distributing vertices along a Hamiltonian cycle in Dirac graphs

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

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