scientific article; zbMATH DE number 3378938
From MaRDI portal
Publication:5650698
zbMath0239.05112MaRDI QIDQ5650698
Publication date: 1971
Full work available at URL: https://eudml.org/doc/193186
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (55)
Partitions of large Boolean lattices ⋮ The pseudograph \((r, s, a, t)\)-threshold number ⋮ Egalitarian Steiner quadruple systems of doubly even order ⋮ Equitable factorizations of edge-connected graphs ⋮ Unnamed Item ⋮ Embedding partial totally symmetric quasigroups. ⋮ Embedding partial triple systems ⋮ Embedding partial Mendelsohn triple systems ⋮ Internally fair factorizations and internally fair holey factorizations with prescribed regularity ⋮ Embedding partial extended triple systems and totally symmetric quasigroups ⋮ Excessive factorizations of bipartite multigraphs ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ Constructing day-balanced round-robin tournaments with partitions ⋮ Regular and canonical colorings ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ Partial Colorings of Unimodular Hypergraphs ⋮ Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations ⋮ Generalized latin rectangles I: Construction and decomposition ⋮ Hamiltonian double Latin squares ⋮ The method of coloring in graphs and its application ⋮ Good and nice colorings of balanced hypergraphs ⋮ Some results in chromatic scheduling ⋮ On minimum sets of 1-factors covering a complete multipartite graph ⋮ Obstructions for regular colorings ⋮ On balanced colorings of sparse hypergraphs ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ Maximal sets of Hamilton cycles in \(K_{2p}-F\) ⋮ Resolvable gregarious cycle decompositions of complete equipartite graphs ⋮ Hamilton decompositions of complete graphs with a 3-factor leave. ⋮ Small embeddings for partial triple systems of odd index ⋮ The embedding of partial triple systems when 4 divides \(\lambda\) ⋮ Exact embedding of two \(G\)-designs into a \((G+e)\)-design ⋮ Grooming traffic to minimize load ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ A note on the \((g, f)\)-coloring ⋮ \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs ⋮ Covering graphs with matchings of fixed size ⋮ Degree-bounded factorizations of bipartite multigraphs and of pseudographs ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ Some remarks on good colorations ⋮ An extension of bipartite multigraphs ⋮ Uniqueness of colorings ⋮ On the excessive \([m\)-index of a tree] ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ On some characterisations of totally unimodular matrices ⋮ A note on the ascending subgraph decomposition problem ⋮ From L. Euler to D. König ⋮ Embeddings of partial Steiner triple systems ⋮ Unnamed Item ⋮ Integral decomposition in polyhedra ⋮ Fair Hamilton decompositions of complete multipartite graphs ⋮ Variation on a theorem of König ⋮ A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions ⋮ A sufficient condition for equitable edge-colourings of simple graphs
This page was built for publication:
