Jerzy Topp

Discret. Appl. Math., January, 2024

2023

Common edge independence number of a tree (Brief Announcement).

[BibT_eX]

[DOI]

Magdalena Lemanska

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Graphs with disjoint $2$-dominating sets.

[BibT_eX]

[DOI]

Australas. J Comb., 2022

2021

Common Independence in Graphs.

[BibT_eX]

[DOI]

Magdalena Lemanska

Symmetry, 2021

Minimal graphs with disjoint dominating and paired-dominating sets.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

2020

Graphs with equal domination and covering numbers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Disjoint dominating and 2-dominating sets in graphs.

[BibT_eX]

[DOI]

Mateusz Miotk

Pawel Zylinski

Discret. Optim., 2020

Certified domination.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2020

2019

Bipartization of Graphs.

[BibT_eX]

[DOI]

Mateusz Miotk

Pawel Zylinski

Graphs Comb., 2019

Domination subdivision and domination multisubdivision numbers of graph.

[BibT_eX]

[DOI]

Joanna Raczek

Discuss. Math. Graph Theory, 2019

On accurate domination in graphs.

[BibT_eX]

[DOI]

Joanna Cyman

Discuss. Math. Graph Theory, 2019

2015

Hangable Graph.

[BibT_eX]

[DOI]

Mateusz Miotk

CoRR, 2015

2000

alphak- and gammak-stable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

1998

Interpolation theorems for domination numbers of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1998

Interpolation theorems for the (r, s)-domination number of spanning trees.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

1997

Totally equimatchable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

Well covered simplicial, chordal, and circular arc graphs.

[BibT_eX]

[DOI]

Erich Prisner

J. Graph Theory, 1996

On numbers of vertices of maximum degree in the spanning trees of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Sequences of graphical invariants.

[BibT_eX]

[DOI]

Networks, 1995

Well Irredundant Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

On unique independent sets in graphs.

[BibT_eX]

[DOI]

Werner Siemes

Discret. Math., 1994

1993

Sufficient conditions for equality of connectivity and minimum degree of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Odd factors of a graph.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Some upper bounds for the product of the domination number and the chromatic number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1993

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices.

[BibT_eX]

[DOI]

Discret. Math., 1993

1991

On packing and covering numbers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

On graphs with equal domination and independent domination numbers.

[BibT_eX]

[DOI]