Wyniki wyszukiwania

1

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

On Hallian digraphs and their binding number

100%

Borowiecki M., Michalak D.

Banach Center Publications

|

1989

|

tom 25

|

nr 1

33-37

2

Generalized domination, independence and irredudance in graphs

81%

Borowiecki M., Michalak D., Sidorowicz E.

Discussiones Mathematicae Graph Theory

|

1997

|

tom 17

|

nr 1

147-153

EN

The purpose of this paper is to present some basic properties of 𝓟-dominating, 𝓟-independent, and 𝓟-irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.

3

Dominating bipartite subgraphs in graphs

81%

Bacsó G., Michalak D., Tuza Z.

Discussiones Mathematicae Graph Theory

|

2005

|

tom 25

|

nr 1-2

85-94

EN

A graph G is hereditarily dominated by a class 𝓓 of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to 𝓓. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.

4

Preface

71%

Drgas-Burchardt E., Hałuszczak M., Kwaśnik M., Michalak D., Sidorowicz E.

Discussiones Mathematicae Graph Theory

|

2013

|

tom 33

|

nr 1

5-6

5

On the binding number of some Hallian graphs

70%

Borowiecki M., Michalak D.

Applicationes Mathematicae

|

1987

|

tom 19

|

nr 3-4

363-370

Ograniczanie wyników

3 Discussiones Mathematicae Graph Theory

1 Applicationes Mathematicae

1 Banach Center Publications

5 Michalak D.

3 Borowiecki M.

2 Sidorowicz E.

1 Bacsó G.

1 Drgas-Burchardt E.

1 Hałuszczak M.

1 Kwaśnik M.

1 Tuza Z.

1 2013

1 2005

1 1997

1 1989

1 1987

On Hallian digraphs and their binding number

Generalized domination, independence and irredudance in graphs

Dominating bipartite subgraphs in graphs

Preface

On the binding number of some Hallian graphs