2008
DOI: 10.37236/860
|View full text |Cite
|
Sign up to set email alerts
|

Strongly Maximal Matchings in Infinite Graphs

Abstract: Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N thereWe prove that if w assumes only finitely many values all of which are rational then G has a strongly w-maximal matching.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 5 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?