On a 1-factor of the fourth power of a connected graph

DOI10.21136/CPM.1988.118359MaRDI QIDQ3828042zbMATH OpenOpenAlexFDO

Authors Ladislav Nebeský

Publication date 1988

Full work available at URL https://eudml.org/doc/21725

zbMATH Keywords

1-factorHamilton cyclemaximum degreeperfect matchingtriangle free subgraph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 3966119
• scientific article; zbMATH DE number 409961
• scientific article; zbMATH DE number 31019
• scientific article; zbMATH DE number 536570
• Triangle-factors in powers of graphs

Cited in

(3)

• Triangle-factors in powers of graphs
• scientific article; zbMATH DE number 3966119 (Why is no real title available?)
• Edge-disjoint 1-factors in powers of connected graphs

This page was built for publication: On a $1$-factor of the fourth power of a connected graph

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