Publication

Bicolored matchings in some classes of graphs

Dominique de Werra
2007
Journal Articles

Abstract

We consider the problem of finding in a graph a set $R$ of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with $n$ nodes on each side, we give sufficient conditions for the existence of a set $R$ with $|R| = n + 1$ such that perfect matchings with $k$ red edges exist for all $k, 0\le k\le n$ . Given two integers $p

Official source

https://infoscience.epfl.ch/entities/publication/a3074e82-7cb1-43de-b212-ac5f9e786b2f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.

Dominique de Werra
2007
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/a3074e82-7cb1-43de-b212-ac5f9e786b2f

About this result

Related publications (30)

Bicolored matchings in some classes of graphs

Chat with Graph Search

The Power of Two Matrices in Spectral Algorithms for Community Recovery

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Non-planarity of Markoff graphs mod p