Trois Types De Décompositions D'un Graphe En Chaînes

DOI10.1016/S0304-0208(08)73380-2zbMath0537.05052OpenAlexW36540234WikidataQ60781993 ScholiaQ60781993MaRDI QIDQ3322142

André Bouchet, Jean-Luc Fouquet

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73380-2

zbMATH Keywords

Hamiltonian cycleHamiltonian pathuniversally decomposableuniversally factorizable

Mathematics Subject Classification ID

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

Related Items (13)

Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\) ⋮ Path decompositions of regular graphs with prescribed girth ⋮ Decomposing regular graphs with prescribed girth into paths of given length ⋮ Decomposing subcubic graphs into claws, paths or triangles ⋮ Multidecompositions of the balanced complete bipartite graph into paths and stars ⋮ On decomposing even regular multigraphs into small isomorphic trees ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Decomposing highly connected graphs into paths of length five ⋮ Unnamed Item ⋮ Codes for distributed storage from 3-regular graphs ⋮ Decomposing Cubic Graphs into Connected Subgraphs of Size Three ⋮ Unnamed Item ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five

This page was built for publication: Trois Types De Décompositions D'un Graphe En Chaînes