Weighted well-covered claw-free graphs

DOI10.1016/j.disc.2014.10.008zbMath1305.05176arXiv1312.7563OpenAlexW2962759348MaRDI QIDQ482209

David Tankus, Vadim E. Levit

Publication date: 19 December 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.7563

zbMATH Keywords

claw-free graphmaximal matchingmaximal independent setwell-covered graphequimatchable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (9)

Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Equimatchable claw-free graphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ Complexity results for generating subgraphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Partitions and well-coveredness: the graph sandwich problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
• On maximal independent sets of vertices in claw-free graphs
• A characterization of well covered graphs of girth 5 or greater
• The structure of well-covered graphs and the complexity of their recognition problems
• Very well covered graphs
• Well-covered claw-free graphs
• Well-covered graphs without cycles of lengths 4, 5 and 6
• Efficient recognition of equimatchable graphs
• On relating edges in graphs without cycles of length 4
• The structure of well-covered graphs with no cycles of length 4
• On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
• Complexity results for well‐covered graphs
• Local Structure When All Maximal Independent Sets Have Equal Weight
• WELL-COVERED GRAPHS: A SURVEY
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Recognizing Greedy Structures
• Well covered simplicial, chordal, and circular arc graphs

This page was built for publication: Weighted well-covered claw-free graphs