ModelingK-coteries by well-covered graphs

DOI<221::AID-NET7>3.0.CO;2-M 10.1002/(SICI)1097-0037(199910)34:3<221::AID-NET7>3.0.CO;2-MzbMath0984.05047OpenAlexW2039321114MaRDI QIDQ2766106

Tsunehiko Kameda, Masafumi Yamashita

Publication date: 27 January 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199910)34:3<221::aid-net7>3.0.co;2-m

zbMATH Keywords

independence numberindependent sets\(k\)-mutual exclusionwell-covered graphs\(k\)-coterie

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Well-covered triangulations. IV ⋮ Graphs with maximal induced matchings of the same size ⋮ Strong cliques in vertex‐transitive graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Complexity results for generating subgraphs ⋮ Detecting strong cliques ⋮ On the independence polynomial of the corona of graphs

Cites Work

• Unnamed Item
• Another distributed algorithm for multiple entries to a critical section
• A characterization of well covered graphs of girth 5 or greater
• Matching-perfect and cover-perfect graphs
• A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
• The structure of well-covered graphs and the complexity of their recognition problems
• Very well covered graphs
• How to assign votes in a distributed system
• Complexity results for well‐covered graphs
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On some subclasses of well-covered graphs
• Recognizing Greedy Structures
• Some covering concepts in graphs

This page was built for publication: ModelingK-coteries by well-covered graphs