Publication

Variations on matchings

Dominique de Werra
1989

Abstract

In a graph G = (X, E) we assign each node v a positive integer b (v) ≤ dG(v) where dG(v) is the degree of v in G. Let P be a collection of edge-disjoint chains such that no two chains in P have a common endpoint and such that in the partial graph H formed by the edge set of P we have dG (v) ≤ b(v) for each node v. P is called a chain packing.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Variations on matchings

Chat with Graph Search

Promotion of cooperation in deme-structured populations with growth-merging dynamics

Structure of architectured material for a mechatronic manipulator and mechatronic manipulator using the same

Möbius Molecules, Pythagorean Triples and Fermat’s Last Theorem