2 papers
math.CO2022
Some Mader-perfect graph classes
Hui Lei, Siyan Li, Xiaopan Lian +1
The dichromatic number of , denoted by , is the smallest integer such that admits an acyclic -coloring. We use to d…
math.CO2021
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
Jianhua Tu, Lei Zhang, Junfeng Du +1
In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-h…