A survey on the computational complexity of coloring graphs with forbidden subgraphs
For a positive integer k, ak‐coloring of a graph is a mapping such that whenever. The
Coloring problem is to decide, for a given G and k, whether ak‐coloring of G exists. If k is …
Coloring problem is to decide, for a given G and k, whether ak‐coloring of G exists. If k is …
[HTML][HTML] Critical (P6, banner)-free graphs
Given two graphs H 1 and H 2, a graph is (H 1, H 2)-free if it contains no induced subgraph
isomorphic to H 1 or H 2. Let P t and C t be the path and the cycle on t vertices, respectively …
isomorphic to H 1 or H 2. Let P t and C t be the path and the cycle on t vertices, respectively …
On graphs with no induced bull and no induced diamond
S Mishra - arXiv preprint arXiv:2107.03750, 2021 - arxiv.org
A bull is the graph obtained by adding two pendant edges at different vertices of a triangle. A
diamond is the graph obtained from a $ K_4 $ by deleting an edge. In this paper, we study …
diamond is the graph obtained from a $ K_4 $ by deleting an edge. In this paper, we study …
The maximum weight stable set problem in (, bull)-free graphs
F Maffray, L Pastor - International Workshop on Graph-Theoretic Concepts …, 2016 - Springer
The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs | SpringerLink
Skip to main content Advertisement SpringerLink Account Menu Find a journal Publish with us …
Skip to main content Advertisement SpringerLink Account Menu Find a journal Publish with us …