A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Arithmetically maximal independent sets in infinite graphs
2005
Discussiones Mathematicae Graph Theory
Preserved Fulltext
Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed. A positive answer is given to the following classes of infinite graphs: bipartite graphs, line graphs and graphs having locally infinite clique-cover of vertices. Some counter examples are presented.
doi:10.7151/dmgt.1270
fatcat:xbzyjjmklrbedcvegorn24q63a