scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

automorphism group Latin squares Cayley graphs critical graphs chromatic index graphs and groups vertex-transitive graphs packing problems maximum valency edge-colourings Frucht's theorem vertex-colourings computational complexity of graph properties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (76)

Coloring of a non-zero component graph associated with a finite dimensional vector space ⋮ A survey of partial difference sets ⋮ Embedding graphs of small size ⋮ On the size of edge-chromatic critical graphs ⋮ Proper divisor graph of a positive integer ⋮ Triple placement of graphs ⋮ On the zero-divisor graph of a commutative ring ⋮ A new class of interconnection networks based on the alternating group ⋮ The graphical complexity of direct products of permutation groups ⋮ Cayley, Marty and Schreier hypergraphs ⋮ Bounds on the lower size of a 7-critical graph ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ There are no edge-chromatic 4-critical graphs of order 12 ⋮ A note on packing of three forests ⋮ Packing bipartite graphs ⋮ 3- and 4-critical graphs of small even order ⋮ Zero-divisor graphs and total coloring conjecture ⋮ On the complete chromatic number of Halin graphs ⋮ Remarks on the size of critical edge-chromatic graphs ⋮ Vertex-splitting and chromatic index critical graphs ⋮ Packing of two digraphs into a transitive tournament ⋮ Packing three trees ⋮ A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture ⋮ On the size of graphs of class 2 whose cores have maximum degree two ⋮ Symmetry groups of Boolean functions and constructions of permutation groups ⋮ Total chromatic number of completer-partite graphs ⋮ Chromatic-index critical multigraphs of order 20 ⋮ A local-sparing design methodology for fault-tolerant multiprocessors ⋮ On the size of edge chromatic critical graphs ⋮ On edge colorings of \(1\)-planar graphs ⋮ An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree ⋮ A note on packing trees into complete bipartite graphs and on Fishburn's conjecture ⋮ Edge coloring of graphs with small average degrees ⋮ Recognition problems and communication complexity. ⋮ Packing of graphs and permutations -- a survey ⋮ On zero-divisor graphs of commutative rings without identity ⋮ Graphical cyclic permutation groups ⋮ A note on the ``packing of two copies of some trees into their third power ⋮ Some results on the complexity of families of sets ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ Exact epidemic models on graphs using graph-automorphism driven lumping ⋮ Some sufficient conditions for 1-planar graphs to be class 1 ⋮ Graphical complexity of products of permutation groups ⋮ Graphs on which a dihedral group acts edge-transitively ⋮ All trees are 1-embeddable and all except stars are 2-embeddable ⋮ Strongly regular semi-Cayley graphs ⋮ On the elusiveness of Hamiltonian property ⋮ All self-complementary symmetric graphs ⋮ On self-complementary supergraphs of (\(n,n\))-graphs ⋮ Graphs on which a group of order \(pq\) acts edge-transitively ⋮ Total chromatic number of one kind of join graphs ⋮ A note on certain subpolytopes of the assignment polytope associated with circulant graphs ⋮ The nil-graph of ideals of a commutative ring ⋮ On the independence number of edge chromatic critical graphs ⋮ Cyclic automorphism groups of graphs and edge-colored graphs ⋮ Chromatic-index-critical graphs of even order ⋮ The spectral radius of edge chromatic critical graphs ⋮ Edge‐chromatic critical graphs and the existence of 1‐factors ⋮ Cyclic permutation groups that are automorphism groups of graphs ⋮ The edge version of Hadwiger's conjecture ⋮ Direct product of automorphism groups of digraphs ⋮ A note on the total chromatic number of Halin graphs with maximum degree 4 ⋮ Unnamed Item ⋮ On the automorphism groups of edge-coloured digraphs ⋮ Graphical representations of cyclic permutation groups ⋮ Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\) ⋮ Packing of graphs - a survey ⋮ Measurements of edge-uncolorability ⋮ Direct product of automorphism groups of colored graphs ⋮ Direct products of automorphism groups of graphs ⋮ New results on chromatic index critical graphs ⋮ Chromatic-index-critical graphs of orders 13 and 14 ⋮ Mutual placement of bipartite graphs ⋮ Generalized symmetry of graphs ⋮ Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups ⋮ Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs

This page was built for publication: