scientific article; zbMATH DE number 3325507
From MaRDI portal
Publication:5604409
Cited in
(39)- Some sequences associated with combinatorial structures
- The chromatic index of nearly bipartite multigraphs
- Some applications of doubly stochastic matrices
- Generalized latin rectangles I: Construction and decomposition
- Critical graphs for chromatic difference sequences
- Class-uniformly resolvable pairwise balanced designs with block size two and three
- The spectrum of maximal sets of one-factors
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- Some remarks on good colorations
- Multigraphs with quasiweak odd cycles
- Extensions of coloring models for scheduling purposes
- Majorization, packing, covering and matroids
- Wide partitions, Latin tableaux, and Rota's basis conjecture
- Short solution of Kotzig's problem for bipartite graphs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Generalized edge packings
- Edge-colouring graphs with bounded local degree sums
- Investigations on an edge coloring problem
- A preemptive open shop scheduling problem with one resource
- Solving matching problems efficiently in bipartite graphs
- On the chromatic index of cographs and join graphs
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Transversal matroid intersections and related packings
- scientific article; zbMATH DE number 3438894 (Why is no real title available?)
- Partitions into odd chains
- Active redundancy allocation for coherent systems with independent and heterogeneous components
- Polyhedra and optimization in connection with a weak majorization ordering
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- Edge coloring complete uniform hypergraphs with many components
- A generalization of interval edge-colorings of graphs
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- A tutorial on graph models for scheduling round‐robin sports tournaments
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
- Minimal Armstrong databases for cardinality constraints
- Additive combinatorial designs
- Sets of vertices with extremal energy
- The chromatic index of graphs with large maximum degree
- Covering graphs with matchings of fixed size
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 Q5604409)
