scientific article; zbMATH DE number 3218576

zbMATH Open0134.43402MaRDI QIDQ5345646FDOQ5345646

Authors: Anton Kotzig 

Publication date: 1965

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cited In (38)

• Binomial trees are graceful
• Decomposition of \(K_n\) into circuits of odd length
• Pack graphs with subgraphs of size three
• Mutually orthogonal cycle systems
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Edge partitions of complete multipartite graphs into equal length circuits
• Maximum packings with odd cycles
• Decompositions of complete graphs into isomorphic cubes
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
• Title not available (Why is that?)
• On the harmonious chromatic number of a graph
• Cyclically decomposing the complete graph into cycles
• On the existence of elementary Abelian cycle systems
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Another class of balanced graph designs: Balanced circuit designs
• Neighbor designs
• Cyclic cycle systems of the complete multipartite graph
• Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)
• Difference systems, graph designs, and coloring problems
• Packing and covering of the complete graph with a graph G of four vertices or less
• Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph
• Towards optimal embedding of an arbitrary tree in a graceful tree
• Generating graceful trees from caterpillars by recursive attachment
• Generating graceful unicyclic graphs from a given forest
• \(G\)-designs and related designs
• Cyclic Hamiltonian cycle systems of the complete graph.
• Embedding an arbitrary tree in a graceful tree
• Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
• Maximum cyclic 4-cycle packings of the complete multipartite graph
• Graceful 2-regular graphs and Skolem sequences
• All 2-regular graphs consisting of 4-cycles are graceful
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• A guide to the graph labeling zoo
• Some constructions for cyclic perfect cycle systems
• The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
• Decomposition of the complete directed graph into k-circuits
• Colouring even cycle systems

This page was built for publication:

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