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

DOI10.1016/S0304-0208(08)73380-2zbMATH Open0537.05052OpenAlexW36540234WikidataQ60781993 ScholiaQ60781993MaRDI QIDQ3322142FDOQ3322142

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 3865323
• Decomposition of Graphs into Chains
• Decompositions of cubic traceable graphs
• Publication:4944984
• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars

Cited In (15)

• Decomposing cubic graphs into connected subgraphs of size three
• Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars
• Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
• On decomposing even regular multigraphs into small isomorphic trees
• Codes for distributed storage from 3-regular graphs
• Multidecompositions of the balanced complete bipartite graph into paths and stars
• Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\)
• Decomposing subcubic graphs into claws, paths or triangles
• Title not available (Why is no real title available?)
• Path decompositions of regular graphs with prescribed girth
• Decomposition of Graphs into Chains
• Title not available (Why is no real title available?)
• Decomposing highly connected graphs into paths of length five
• Decompositions of triangle-free 5-regular graphs into paths of length five
• Decomposing regular graphs with prescribed girth into paths of given length

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

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