Premium
König's edge coloring theorem without augmenting paths
Author(s) -
Rizzi Romeo
Publication year - 1998
Publication title -
journal of graph theory
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199810)29:2<87::aid-jgt4>3.0.co;2-8
Subject(s) - mathematics , combinatorics , edge coloring , enhanced data rates for gsm evolution , brooks' theorem , complete coloring , discrete mathematics , 1 planar graph , graph , chordal graph , computer science , line graph , artificial intelligence , graph power
We give a simple, self‐contained proof of the following basic fact [1, 2] in matching theory. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 87, 1998