• English
    • français
  • English 
    • English
    • français
Search 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Search
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-1 of 1

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

A Characterization of Fractionally Well-Covered Graphs 

Currie, James; Nowakowski, Richard (Ars Combinatoria, 1991)
A graph is called well-covered if every maximal independent set has the same size. One generalization of independent sets in graphs is that of a fractional cover -- attach nonnegative weights to the vertices and require ...

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Discover

AuthorCurrie, James (1)
Nowakowski, Richard (1)
SubjectGraphs (1)Well-Covered graphs (1)... View MoreDate Issued1991 (1)Has File(s)Yes (1)

Report a copyright concern

Contact Us | Send Feedback