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