scientific article; zbMATH DE number 3325507

From MaRDI portal
Publication:5604409

zbMath0204.57002MaRDI QIDQ5604409

D. R. Fulkerson, Jon Folkman

Publication date: 1969


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



Related Items (35)

The chromatic index of nearly bipartite multigraphsACTIVE REDUNDANCY ALLOCATION FOR COHERENT SYSTEMS WITH INDEPENDENT AND HETEROGENEOUS COMPONENTSUnnamed ItemOn the chromatic index of cographs and join graphsA preemptive open shop scheduling problem with one resourceSome applications of doubly stochastic matricesEdge coloring complete uniform hypergraphs with many componentsA generalization of interval edge-colorings of graphsSolving Matching Problems Efficiently in Bipartite GraphsEdge-colouring graphs with bounded local degree sumsNotes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in DigraphsOn the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k\)-matching] ⋮ Polyhedra and optimization in connection with a weak majorization orderingA tutorial on graph models for scheduling round‐robin sports tournamentsGeneralized latin rectangles I: Construction and decompositionCritical graphs for chromatic difference sequencesWide partitions, Latin tableaux, and Rota's basis conjectureClass-uniformly resolvable pairwise balanced designs with block size two and threeThe spectrum of maximal sets of one-factorsSome preemptive open shop scheduling problems with a renewable or a nonrenewable resourceOn the chromatic index of join graphs and triangle-free graphs with large maximum degreeCovering graphs with matchings of fixed sizePacking, covering and decomposing of a complete uniform hypergraph into delta-systemsTransversal matroid intersections and related packingsSome remarks on good colorationsMultigraphs with quasiweak odd cyclesSupermodularity in Unweighted Graph Optimization I: Branchings and MatchingsExtensions of coloring models for scheduling purposesInvestigations on an edge coloring problemPartitions into odd chainsGeneralized edge packingsShort solution of Kotzig's problem for bipartite graphsThe chromatic index of graphs with large maximum degreeMajorization, packing, covering and matroidsSome sequences associated with combinatorial structures




This page was built for publication: