On well-covered Cartesian products
From MaRDI portal
Publication:1756093
DOI10.1007/s00373-018-1943-3zbMath1441.05197arXiv1703.08716OpenAlexW2604526143MaRDI QIDQ1756093
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.08716
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Well-hued graphs, On well-dominated graphs, A characterization of well-dominated Cartesian products, On well-dominated direct, Cartesian and strong product graphs, On well-covered direct products
Cites Work
- On the well-coveredness of Cartesian products of graphs
- A characterization of well covered graphs of girth 5 or greater
- On the Cartesian product of non well-covered graphs
- WELL-COVERED GRAPHS: A SURVEY
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Some covering concepts in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item