scientific article; zbMATH DE number 3378938
From MaRDI portal
Publication:5650698
zbMATH Open0239.05112MaRDI QIDQ5650698FDOQ5650698
Authors: Dominique De Werra 
Publication date: 1971
Full work available at URL: https://eudml.org/doc/193186
Title of this publication is not available (Why is that?)
Cited In (70)
- Equitable coloring of some convex polytope graphs
- Exact embedding of two \(G\)-designs into a \((G+e)\)-design
- Uniqueness of colorings
- Fair Hamilton decompositions of complete multipartite graphs
- Constructing day-balanced round-robin tournaments with partitions
- On Equitable Coloring of d-Degenerate Graphs
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
- Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
- Partitions of large Boolean lattices
- Embedding partial Mendelsohn triple systems
- Embedding partial triple systems
- Equitable list coloring of graphs
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
- On the equitable edge-coloring of 1-planar graphs and planar graphs
- A note on the ascending subgraph decomposition problem
- The pseudograph \((r, s, a, t)\)-threshold number
- The embedding of partial triple systems when 4 divides \(\lambda\)
- Regular and canonical colorings
- On Packing Dijoins in Digraphs and Weighted Digraphs
- A sufficient condition for equitable edge-colourings of simple graphs
- Hamilton decompositions of complete graphs with a 3-factor leave.
- Egalitarian Steiner quadruple systems of doubly even order
- On some characterisations of totally unimodular matrices
- Integral decomposition in polyhedra
- Embedding partial extended triple systems and totally symmetric quasigroups
- Excessive factorizations of bipartite multigraphs
- Resolvable gregarious cycle decompositions of complete equipartite graphs
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- Embeddings of partial Steiner triple systems
- Equitable \(\Delta\)-coloring of graphs
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
- On the excessive \([m]\)-index of a tree
- Obstructions for regular colorings
- Covering graphs with matchings of fixed size
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- Chromatic optimisation: Limitations, objectives, uses, references
- The method of coloring in graphs and its application
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
- On minimum sets of 1-factors covering a complete multipartite graph
- On balanced colorings of sparse hypergraphs
- Good and nice colorings of balanced hypergraphs
- A fast algorithm for equitable coloring
- Variation on a theorem of König
- Equitable block colourings.
- Mathematical Foundations of Computer Science 2004
- On equitable coloring of bipartite graphs
- On evenly-equitable, balanced edge-colorings and related notions
- Small embeddings for partial triple systems of odd index
- Maximal sets of Hamilton cycles in \(K_{2p}-F\)
- Equitable Colourings of d-degenerate Graphs
- Some remarks on good colorations
- Grooming traffic to minimize load
- Generalized latin rectangles I: Construction and decomposition
- An extension of bipartite multigraphs
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Internally fair factorizations and internally fair holey factorizations with prescribed regularity
- Equitable coloring parameters of certain graph classes
- A note on the \((g, f)\)-coloring
- Hamiltonian double Latin squares
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embedding partial totally symmetric quasigroups.
- Equitable factorizations of edge-connected graphs
- Partial Colorings of Unimodular Hypergraphs
- On the complexity of computing the excessive \([B]\)-index of a graph
- Total colorings of complete multipartite graphs using amalgamations
- Extreme equitable block colorings of \(C_4\)-decompositions of \(K_v-F\)
- From L. Euler to D. König
- Some results in chromatic scheduling
- On equitable colouring of Knödel graphs
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 Q5650698)
