Well-hued graphs
From MaRDI portal
Publication:2166254
DOI10.1016/j.dam.2022.06.010zbMath1495.05093OpenAlexW4283362863MaRDI QIDQ2166254
Kirsti Kuenzel, Eileen Melville, Wayne Goddard
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.06.010
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-covered triangulations. IV
- Results on the Grundy chromatic number of graphs
- On well-covered triangulations. III
- On the well-coveredness of Cartesian products of graphs
- A characterization of well covered graphs of girth 5 or greater
- Brooks' graph-coloring theorem and the independence number
- On well-covered Cartesian products
- Very well covered graphs
- On the Cartesian product of non well-covered graphs
- On well-covered direct products
- Graphs in which all maximal bipartite subgraphs have the same order
- Complexity results for well‐covered graphs
- WELL-COVERED GRAPHS: A SURVEY
This page was built for publication: Well-hued graphs