Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs-Reference-Cited by-同舟云学术

Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs

Author:

Milanič Martin¹²,Trotignon Nicolas³

Affiliation:

1. UNIVERSITY OF PRIMORSKA; UP IAM, MUZEJSKI TRG 2 SI-6000 KOPER SLOVENIA

2. UNIVERSITY OF PRIMORSKA; UP FAMNIT, GLAGOLJAŠKA 8 SI-6000 KOPER SLOVENIA

3. CNRS, LIP, ENS DE LYON; INRIA UNIVERSITÉ DE LYON LYON FRANCE

Funder

Javna Agencija za Raziskovalno Dejavnost RS

Agence Nationale de la Recherche

LABEX MILYON

Université de Lyon

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference24 articles.

1. Strong cliques and equistability of EPT graphs;Alcón;Discrete Appl Math,2015

2. When are chordal graphs also partition graphs;Anbeek;Australas J Combin

3. Equistarable bipartite graphs;Boros;Discrete Math,2015

4. On equistable, split, CIS, and related classes of graphs;Boros;Discrete Appl Math,2015

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Strong cliques in diamond-free graphs;Theoretical Computer Science;2021-02

3. Strong Cliques in Diamond-Free Graphs;Graph-Theoretic Concepts in Computer Science;2020

4. Detecting strong cliques;Discrete Mathematics;2019-09