scientific article
From MaRDI portal
Publication:3998644
zbMath0701.05042MaRDI QIDQ3998644
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyautomorphism groupHamiltonian cyclesHamiltonian pathscolouringsisomorphism of graphsdecompositions of graphsself- complementary graphs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (47)
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs ⋮ Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors ⋮ Multidecompositions of several graph products ⋮ Path decompositions of regular graphs with prescribed girth ⋮ Kirkman's school projects ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ A note on decompositions of transitive tournaments ⋮ The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar ⋮ Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Factorizations of the product of cycles ⋮ Petersen graph decompositions of complete multipartite graphs ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ Approximation algorithms for multiple sequence alignment ⋮ A cube dismantling problem related to bootstrap percolation ⋮ Towards a solution of the Holyer's problem ⋮ Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Brooks-type theorem for \(r\)-hued coloring of graphs ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Decompositions of edge-colored complete graphs ⋮ Hamilton cycle decompositions of the tensor product of complete multipartite graphs ⋮ Primitive decompositions of Johnson graphs ⋮ Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length ⋮ \(d\)-cube decompositions of \(K_n\setminus K_m\) ⋮ A short update on equipackable graphs ⋮ The cardinality of the collection of maximum independent sets of a functional graph ⋮ All \(P_{3}\)-equipackable graphs ⋮ Decomposition of balanced complete bipartite multigraphs into multistars ⋮ Multigraph decomposition into stars and into multistars ⋮ Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges ⋮ Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs ⋮ Graphs as navigational infrastructure for high dimensional data spaces ⋮ Balanced path decomposition of λ K n,n and λ K n,n * ⋮ Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree ⋮ Unnamed Item ⋮ On a generalization of the Oberwolfach problem ⋮ On Some Graph Operations and Related Applications ⋮ Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles ⋮ Cycle factorizations of cycle products ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ Anti-Ramsey colorings in several rounds ⋮ Cluttered orderings for the complete bipartite graph ⋮ Decomposition of the complete bipartite multigraph into cycles and stars ⋮ Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five ⋮ On hamiltonian decompositions of tensor products of graphs
This page was built for publication: