scientific article; zbMATH DE number 3325507

zbMATH Open0204.57002MaRDI QIDQ5604409FDOQ5604409

Authors: Jon Folkman, D. R. Fulkerson 

Publication date: 1969

Title of this publication is not available (Why is that?)

Cited In (37)

• 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
• Title not available (Why is that?)
• Partitions into odd chains
• The chromatic index of nearly bipartite multigraphs
• Some applications of doubly stochastic matrices
• 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
• 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
• A generalization of interval edge-colorings of graphs
• Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
• 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
• A tutorial on graph models for scheduling round‐robin sports tournaments
• Extensions of coloring models for scheduling purposes
• Transversal matroid intersections and related packings
• ACTIVE REDUNDANCY ALLOCATION FOR COHERENT SYSTEMS WITH INDEPENDENT AND HETEROGENEOUS COMPONENTS
• Short solution of Kotzig's problem for bipartite graphs
• Solving Matching Problems Efficiently in Bipartite Graphs
• Polyhedra and optimization in connection with a weak majorization ordering
• The spectrum of maximal sets of one-factors
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• The chromatic index of graphs with large maximum degree
• Generalized edge packings
• Some remarks on good colorations
• Generalized latin rectangles I: Construction and decomposition
• 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)