Premium
A note on n ‐extendable graphs
Author(s) -
Yu Qinglin
Publication year - 1992
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190160408
Subject(s) - combinatorics , mathematics , matching (statistics) , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence , statistics
A graph G having a perfect matching is called n‐ extendable if every matching of size n of G can be extended to a perfect matching. In this note, we show that if G is an n ‐extendable nonbipartite graph, then G + e is ( n ‐ 1)‐extendable for any edge e ϵ E(G). © 1992 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom