Lutz Volkmann

,

,

Yun Wang

Appl. Math. Comput., 2025

More results on the signed double Roman domination number of graphs.

[BibT_eX]

[DOI]

,

AKCE Int. J. Graphs Comb., 2025

New bounds on the outer-independent total double Roman domination number.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., May, 2024

Outer independent total double Italian domination number.

[BibT_eX]

[DOI]

,

Comput. Sci. J. Moldova, 2024

Outer Independent Double Roman Domination Stability in Graphs.

[BibT_eX]

[DOI]

,

M. Esmaeili

,

Ars Comb., 2024

Double Roman and double Italian domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

Total Italian domatic number of graphs.

[BibT_eX]

[DOI]

,

Comput. Sci. J. Moldova, 2023

Nordhaus-Gaddum type inequalities on the total Italian domination number in graphs.

[BibT_eX]

[DOI]

,

RAIRO Oper. Res., 2022

Restrained double Roman domination of a graph.

[BibT_eX]

[DOI]

,

Iman Masoumi

,

RAIRO Oper. Res., 2022

The Roman domatic problem in graphs and digraphs: a survey.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2022

Restrained Roman and restrained Italian domatic numbers of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Nordhaus-Gaddum type results for connected and total domination.

[BibT_eX]

[DOI]

Rana Khoeilar

,

Hossein Karami

,

,

,

RAIRO Oper. Res., 2021

Oriented diameter of maximal outerplanar graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2021

Domination, independent domination number and 2-independence number in trees.

[BibT_eX]

[DOI]

Hamideh Aram

,

Nasrin Dehgardi

,

,

Mina Valinavaz

,

Discuss. Math. Graph Theory, 2021

Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected.

[BibT_eX]

[DOI]

,

,

,

Complex., 2021

Total Roman {3}-domination in Graphs.

[BibT_eX]

[DOI]

Zehui Shao

,

,

Symmetry, 2020

The double Roman domatic number of a digraph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Critical concept for double Roman domination in graphs.

[BibT_eX]

[DOI]

Sakineh Nazari-Moghaddam

,

Discret. Math. Algorithms Appl., 2020

Roman {3}-domination (double Italian domination).

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2020

A proof of a conjecture on the differential of a subcubic graph.

[BibT_eX]

[DOI]

R. Khoeilar

,

Hossein Karami

,

,

,

Discret. Appl. Math., 2020

Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs.

[BibT_eX]

[DOI]

,

,

Contributions Discret. Math., 2020

Varieties of Roman domination II.

[BibT_eX]

[DOI]

,

,

,

AKCE Int. J. Graphs Comb., 2020

Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

On the co-Roman domination in graphs.

[BibT_eX]

[DOI]

Zehui Shao

,

,

Marzieh Soroudi

,

,

Xinmiao Liu

Discuss. Math. Graph Theory, 2019

Bounds on the signed Roman k-domination number of a digraph.

[BibT_eX]

[DOI]

Xiaodan Chen

,

Guoliang Hao

,

Discuss. Math. Graph Theory, 2019

The Roman {2}-domatic number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Bounds on the fair total domination number in trees and unicyclic graphs.

[BibT_eX]

[DOI]

Majid Hajian

,

,

Australas. J Comb., 2019

An upper bound on the double Roman domination number.

[BibT_eX]

[DOI]

,

Sakineh Nazari-Moghaddam

,

,

J. Comb. Optim., 2018

Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number.

[BibT_eX]

[DOI]

Sebastian Milz

,

Discret. Math., 2018

An introduction to the twin signed total k-domination numbers in directed graphs.

[BibT_eX]

[DOI]

Masoud Atapour

,

Nasrin Dehgardi

,

RAIRO Oper. Res., 2017

Roman game domination number of a graph.

[BibT_eX]

[DOI]

A. Bahremandpour

,

,

J. Comb. Optim., 2017

On the signed 2-independence number of graphs.

[BibT_eX]

[DOI]

S. M. Hosseini Moghaddam

,

,

,

Electron. J. Graph Theory Appl., 2017

The signed total Roman k-domatic number of a graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Signed total Roman domination in digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Signed Roman edge k-domination in graphs.

[BibT_eX]

[DOI]

Leila Asgharsharghi

,

,

Discuss. Math. Graph Theory, 2017

Universal arcs in local tournaments.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2017

Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs.

[BibT_eX]

[DOI]

Zhibing Chen

,

Guifu Su

,

Discret. Appl. Math., 2017

The k-rainbow reinforcement numbers in graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2017

Lower bounds on the signed k-domination number of graphs.

[BibT_eX]

Ars Comb., 2017

Generalization of the total outer-connected domination in graphs.

[BibT_eX]

[DOI]

,

RAIRO Oper. Res., 2016

Signed total Roman domination in graphs.

[BibT_eX]

[DOI]

Hossein Abdollahzadeh Ahangar

J. Comb. Optim., 2016

Signed Roman edge domination numbers in graphs.

[BibT_eX]

[DOI]

,

,

,

Hossein Abdollahzadeh Ahangar

,

Yancai Zhao

J. Comb. Optim., 2016

Signed mixed Roman domination numbers in graphs.

[BibT_eX]

[DOI]

,

Leila Asgharsharghi

,

,

J. Comb. Optim., 2016

Signed Roman k-domination in Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Edge-Removal and Edge-Addition in α-Domination.

[BibT_eX]

[DOI]

,

Graphs Comb., 2016

Signed Roman k-Domination in Graphs.

[BibT_eX]

[DOI]

Michael A. Henning

,

Seyyed Mehdi Hosseini Moghaddam

Graphs Comb., 2016

New bounds on the signed total domination number of graphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2016

On the signed total Roman domination and domatic numbers of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Signed (j, k)-domatic number of graphs.

[BibT_eX]

,

Ars Comb., 2016

Matchings in 4-total restrained domination vertex critical graphs.

[BibT_eX]

,

Ars Comb., 2016

Rainbow restrained domination numbers in graphs.

[BibT_eX]

,

,

Hossein Abdollahzadeh Ahangar

Ars Comb., 2016

On the rainbow restrained domination number.

[BibT_eX]

,

,

,

Vladimir Samodivkin

,

Ars Comb., 2016

Total restrained reinforcement in graphs.

[BibT_eX]

[DOI]

,

AKCE Int. J. Graphs Comb., 2016

The signed Roman k-domatic number of digraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

Signed Roman domination in digraphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2015

Global Roman Domination in Trees.

[BibT_eX]

[DOI]

Maryam Atapour

,

,

Graphs Comb., 2015

The signed Roman domatic number of a digraph.

[BibT_eX]

[DOI]

,

Electron. J. Graph Theory Appl., 2015

Upper bounds on the signed total (k, k)-domatic number of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

On the signed (total) k-independence number in graphs.

[BibT_eX]

[DOI]

Abdollah Khodkar

,

,

Discuss. Math. Graph Theory, 2015

The k-rainbow bondage number of a digraph.

[BibT_eX]

[DOI]

,

Negar Mohammadi

,

,

Discuss. Math. Graph Theory, 2015

Signed star (j, k)-domatic numbers of digraphs.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2015

The signed Roman k-domatic number of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Signed Roman k-domination in trees.

[BibT_eX]

[DOI]

Michael A. Henning

,

Discret. Appl. Math., 2015

Signed k-domatic numbers of graphs.

[BibT_eX]

Odile Favaron

,

,

Ars Comb., 2015

The k-rainbow bondage number of a graph.

[BibT_eX]

[DOI]

Nasrin Dehgardi

,

,

Discret. Appl. Math., 2014

Bounds on the k-independence and k-chromatic numbers of graphs.

[BibT_eX]

Mostafa Blidia

,

Ahmed Bouchou

,

Ars Comb., 2014

Roman Domination Dot-critical Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2013

Bounds on the signed 2-independence number in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

The distance Roman domination numbers of graphs.

[BibT_eX]

[DOI]

Hamideh Aram

,

S. Norouzian

,

,

Discuss. Math. Graph Theory, 2013

Complementary cycles in almost regular multipartite tournaments, where one cycle has length four.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

A note on the independent domination number in graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

Smallest regular and almost regular triangle-free graphs without perfect matchings.

[BibT_eX]

Ars Comb., 2013

Signed total (j, k)-domatic numbers of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2013

The total {k}-domatic number of a graph.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2012

k-Domination and k-Independence in Graphs: A Survey.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2012

The total {k}-domatic number of digraphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2012

The k-rainbow domatic number of a graph.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2012

Signed total {k}-domination and {k}-Domatic numbers of Graphs.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2012

Signed 2-independence in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2012

On regular (2, q)-extendable graphs.

[BibT_eX]

Ars Comb., 2012

The smallest regular graphs which are not 1-extendable.

[BibT_eX]

Ars Comb., 2012

Independence and k-domination in graphs.

[BibT_eX]

[DOI]

,

,

Int. J. Comput. Math., 2011

On the Roman Bondage Number of Planar Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2011

Connected global offensive k-alliances in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Signed domination and signed domatic numbers of digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Roman bondage in graphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2011

Characterization of trees with equal 2-domination number and domination number plus two.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2011

Upper bounds on the signed total domatic number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Unique response Roman domination in graphs.

[BibT_eX]

[DOI]

E. Ebrahimi Targhi

,

,

Discret. Appl. Math., 2011

Signed star k-domatic number of a graph.

[BibT_eX]

[DOI]

,

Contributions Discret. Math., 2011

Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.

[BibT_eX]

Ars Comb., 2011

On 2-domination and independence domination numbers of graphs.

[BibT_eX]

,

Ars Comb., 2011

Bounds on the signed domatic number.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph.

[BibT_eX]

[DOI]

,

,

Appl. Math. Lett., 2011

On local connectivity of K2, p-free graphs.

[BibT_eX]

[DOI]

Andreas Holtkamp

,

Australas. J Comb., 2011

2-domination in bipartite graphs with odd independence number.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2011

On local connectivity of graphs with given clique number.

[BibT_eX]

[DOI]

Andreas Holtkamp

,

J. Graph Theory, 2010

Proof of a conjecture on game domination.

[BibT_eX]

[DOI]

Odile Favaron

,

Hossein Karami

,

R. Khoeilar

,

,

J. Graph Theory, 2010

A general method in the theory of domination in graphs.

[BibT_eX]

[DOI]

,

,

Int. J. Comput. Math., 2010

k-independence stable graphs upon edge removal.

[BibT_eX]

[DOI]

,

Teresa W. Haynes

,

Discuss. Math. Graph Theory, 2010

Cycle factors in strongly connected local tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

On the geodetic and geodetic domination numbers of a graph.

[BibT_eX]

[DOI]

,

Discret. Math., 2010

Signed star domatic number of a graph.

[BibT_eX]

[DOI]

Maryam Atapour

,

,

Arezoo N. Ghameshlou

,

Discret. Appl. Math., 2010

The Diameter of Almost Eulerian Digraphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2010

Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.

[BibT_eX]

Ars Comb., 2010

The Roman domatic number of a graph.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2010

On almost 1-extendable graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

Independence and global offensive alliance in graphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2010

A remark on degree sequences of multigraphs.

[BibT_eX]

[DOI]

,

Math. Methods Oper. Res., 2009

Minimum size of a graph or digraph of given radius.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2009

Bounds on the global offensive k-alliance number in graphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2009

Every cycle-connected multipartite tournament has a universal arc.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

On the existence of edge cuts leaving several large components.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

On the number of cycles in local tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

Parity and disparity subgraphs.

[BibT_eX]

[DOI]

Terry A. McKee

,

Discret. Math., 2009

On the connectivity of p-diamond-free graphs.

[BibT_eX]

[DOI]

Andreas Holtkamp

,

Discret. Math., 2009

Complementary cycles in regular multipartite tournaments, where one cycle has length five.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2009

Inverse degree and edge-connectivity.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

The signed domatic number of some regular graphs.

[BibT_eX]

[DOI]

,

,

Stephan Zitzen

Discret. Appl. Math., 2009

Upper bounds on the k-domination number and the k-Roman domination number.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

Some remarks on the signed domatic number of graphs with small minimum degree.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

On regular (1, q)-extendable graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

A characterization of even order trees with domination number half their order minus one.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2009

Global offensive alliance numbers in graphs with emphasis on trees.

[BibT_eX]

[DOI]

,

Teresa W. Haynes

,

Australas. J Comb., 2009

Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.

[BibT_eX]

[DOI]

,

Networks, 2008

On k-domination and minimum degree in graphs.

[BibT_eX]

[DOI]

Odile Favaron

,

,

J. Graph Theory, 2008

A remark on the (2, 2)-domination number.

[BibT_eX]

[DOI]

Torsten Korneffel

,

,

Discuss. Math. Graph Theory, 2008

Strong subtournaments containing a given vertex in regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Some remarks on lambdap, q-connectedness.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

On arc-traceable local tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

All 2-connected in-tournaments that are cycle complementary.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Maximally edge-connected and vertex-connected graphs and digraphs: A survey.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

On graphs with equal domination and 2-domination numbers.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

alpha-Domination perfect trees.

[BibT_eX]

[DOI]

F. Dahme

,

,

Discret. Math., 2008

The connectivity of a graph and its complement.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2008

How close to regular must a multipartite tournament be to secure a given path covering number?

[BibT_eX]

Irene Stella

,

,

Ars Comb., 2008

On local connectivity of graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

On the order of almost regular bipartite graphs without perfect matchings.

[BibT_eX]

[DOI]

,

Axel Zingsem

Australas. J Comb., 2008

A characterization of bipartite graphs with independence number half their order.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

Restricted arc-connectivity of generalized tournaments.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2008

A note on the 2-domination number of a tree.

[BibT_eX]

[DOI]

,

,

,

,

,

Australas. J Comb., 2008

Restricted arc-connectivity of digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Characterization of block graphs with equal 2-domination number and domination number plus one.

[BibT_eX]

[DOI]

Adriana Hansberg Pastor

,

Discuss. Math. Graph Theory, 2007

Local-edge-connectivity in digraphs and oriented graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Multipartite tournaments: A survey.

[BibT_eX]

[DOI]

Discret. Math., 2007

Strongly 4-path-connectivity in almost regular multipartite tournaments.

[BibT_eX]

[DOI]

Irene Stella

,

,

Discret. Math., 2007

On the connectivity of diamond-free graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2007

A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

Distance Domination and Distance Irredundance in Graphs.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2007

On the order of close to regular graphs without a matching of given size.

[BibT_eX]

Sabine Klinkenberg

,

Ars Comb., 2007

Average distance in bipartite tournaments.

[BibT_eX]

,

Ars Comb., 2007

A remark on cycles through an arc in strongly connected multipartite tournaments.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2007

New bounds on the k-domination number and the k-tuple domination number.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2007

On the number of nonseparating vertices in strongly connected local tournaments.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2007

Total and connected domination in digraphs.

[BibT_eX]

[DOI]

S. Arumugam

,

K. Jacob

,

Australas. J Comb., 2007

On connectivity in graphs with given clique number.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2006

Otto Blumenthal (1876-1944) in retrospect.

[BibT_eX]

[DOI]

Paul L. Butzer

,

J. Approx. Theory, 2006

Lower bounds on the vertex-connectivity of digraphs and graphs.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2006

A lower bound for the irredundance number of trees.

[BibT_eX]

[DOI]

Michael Poschen

,

Discuss. Math. Graph Theory, 2006

Extremal bipartite graphs with a unique k-factor.

[BibT_eX]

[DOI]

,

Elzbieta Sidorowicz

,

Discuss. Math. Graph Theory, 2006

Paths with a given number of vertices from each partite set in regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 2006

Longest cycles in almost regular 3-partite tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2006

On cycles in regular 3-partite tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2006

Some bounds on the p-domination number in trees.

[BibT_eX]

[DOI]

Mostafa Blidia

,

,

Discret. Math., 2006

On the connectivity of close to regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2006

Upper bounds on the domination number of a graph in terms of order and minimum degree.

[BibT_eX]

Ars Comb., 2006

Degree sequence conditions for maximally edge-connected oriented graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2006

Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree.

[BibT_eX]

[DOI]

Beate Küpper

,

Australas. J Comb., 2006

On the order of almost regular graphs without a matching of given size.

[BibT_eX]

[DOI]

Sabine Klinkenberg

,

Australas. J Comb., 2006

Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2005

Structural Remarks on Bipartite Graphs with Unique f-Factors.

[BibT_eX]

[DOI]

,

Graphs Comb., 2005

On the p-domination number of cactus graphs.

[BibT_eX]

[DOI]

Mostafa Blidia

,

,

Discuss. Math. Graph Theory, 2005

Cuts leaving components of given minimum order.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2005

Unique irredundance, domination and independent domination in graphs.

[BibT_eX]

[DOI]

,

,

Igor E. Zverovich

Discret. Math., 2005

Signed domatic number of a graph.

[BibT_eX]

[DOI]

,

Bohdan Zelinka

Discret. Appl. Math., 2005

A note on the number of matchings and independent sets in trees.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2005

Extremal Trees with Respect to Dominance Order.

[BibT_eX]

,

,

Ars Comb., 2005

Average distance in k-connected tournaments.

[BibT_eX]

,

Ars Comb., 2005

Complementary cycles in regular multipartite tournaments.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2005

Neighborhood conditions for graphs and digraphs to be maximally edge-connected.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2005

Note on the connectivity of line graphs.

[BibT_eX]

[DOI]

,

,

Inf. Process. Lett., 2004

Extendable Cycles in Multipartite Tournaments.

[BibT_eX]

[DOI]

,

Graphs Comb., 2004

Some remarks on alpha-domination.

[BibT_eX]

[DOI]

F. Dahme

,

,

Discuss. Math. Graph Theory, 2004

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Anders Yeo

Discret. Math., 2004

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Cycles through a given arc and certain partite sets in almost regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

The Petersen graph is not 1-factorable: postscript to The Petersen graph is not 3-edge-colorable - a new proof' [Discrete Math. 268 (2003) 325-326].

[BibT_eX]

[DOI]

Discret. Math., 2004

Hamiltonian paths containing a given arc, in almost regular bipartite tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2004

All regular multipartite tournaments that are cycle complementary.

[BibT_eX]

[DOI]

Discret. Math., 2004

Vertex 6-pancyclic in-tournaments.

[BibT_eX]

[DOI]

Christian Peters

,

Discret. Math., 2004

On unique k-factors and unique [1, k]-factors in graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Sufficient conditions for lambda'-optimality in graphs of diameter 2.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Relations between the lower domination parameters and the chromatic number of a graph.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

On Regular Factors in Regular Graphs with Small Radius.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2004

The Maximum Size Of Graphs With A Unique k- Factor.

[BibT_eX]

[DOI]

Comb., 2004

Maximally local-edge-connected graphs and digraphs.

[BibT_eX]

,

Ars Comb., 2004

On the size of odd order graphs with no almost perfect matching.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Extremal subgraphs with respect to vertex degree bounds.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

On alphargammas(k)-perfect graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

Maximum graphs with a unique minimum dominating set.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2003

Remarks on the bondage number of planar graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2003

A Linear-programming Approach to the Generalized Randic Index.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2003

Cycles of length four through a given arc in almost regular multipartite tournaments.

[BibT_eX]

Ars Comb., 2003

Degree sequence conditions for super-edge-connected graphs and digraphs.

[BibT_eX]

Ars Comb., 2003

Restricted edge-connectivity and minimum edge-degree.

[BibT_eX]

Nicola Ueffing

,

Ars Comb., 2003

Cycles through a given arc in almost regular multipartite tournaments.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2003

Maximally edge-connected digraphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2003

Minimum degree conditions for the Overfull Conjecture for odd order graphs.

[BibT_eX]

[DOI]

Kerstin Bongard

,

,

Australas. J Comb., 2003

Proof of a conjecture on irredundance perfect graphs.

[BibT_eX]

[DOI]

,

Vadim E. Zverovich

J. Graph Theory, 2002

How local irregularity gets global in a graph.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

A disproof of Henning's conjecture on irredundance perfect graphs.

[BibT_eX]

[DOI]

,

Vadim E. Zverovich

Discret. Math., 2002

Cycles in multipartite tournaments: results and problems.

[BibT_eX]

[DOI]

Discret. Math., 2002

Longest paths through an arc in strong semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic.

[BibT_eX]

[DOI]

,

,

Anders Yeo

Discret. Math., 2002

Independent domination and matchings in graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Weighted domination in triangle-free graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2002

Edge-cuts leaving components of order at least three.

[BibT_eX]

[DOI]

Paul S. Bonsma

,

Nicola Ueffing

,

Discret. Math., 2002

Wiener index versus maximum degree in trees.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2002

Cycles through a given arc in certain almost regular multipartite tournaments.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

Unique minimum domination in trees.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2002

Vertex pancyclic in-tournaments.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2001

The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

i gamma(1)-perfect graphs.

[BibT_eX]

[DOI]

Lothar Dohmen

,

,

Discret. Math., 2001

Spanning multipartite tournaments of semicomplete multipartite digraphs.

[BibT_eX]

Ars Comb., 2001

Graphs with unique dominating sets.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2000

Some results on graph parameters in weighted graphs.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2000

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2000

A characterization of rho alpha(k)-perfect graphs.

[BibT_eX]

[DOI]

Lothar Dohmen

,

,

Discret. Math., 2000

Degree sequence conditions for maximally edge-connected graphs depending on the clique number.

[BibT_eX]

[DOI]

,

Discret. Math., 2000

Longest paths through an arc in strongly connected in-tournaments.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

Vertex Pancyclic Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 1999

Maximal Sets of 2-Factors in Complete Equipartite Graphs.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 1999

Graphs having distance-n domination number half their order.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 1999

Longest paths in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Vertex deletion and cycles in multipartite tournaments.

[BibT_eX]

[DOI]

,

Discret. Math., 1999

Strong subtournaments of multipartite tournaments.

[BibT_eX]

[DOI]

Australas. J Comb., 1999

The ratio of the irredundance and domination number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1998

The domatic number of block-cactus graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1998

Characterization of graphs with equal domination and covering number.

[BibT_eX]

[DOI]

,

Discret. Math., 1998

On the cycle structure of in-tournaments.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1998

Some structural results on linear arboricity.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1998

Degree sequence conditions for maximally edge-connected graphs and digraphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1997

On cycles through a given vertex in multipartite tournaments.

[BibT_eX]

[DOI]

,

Axel Pinkernell

,

Discret. Math., 1997

A classification of locally semicomplete digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1997

Bypaths in Tournaments.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 1997

Simplicial Graphs and Relationships to Different Graph Invariants.

[BibT_eX]

,

Ars Comb., 1997

Locally semicomplete digraphs that are complementary m-pancyclic.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1996

Weakly Hamiltonian-connected locally semicomplete digraphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

,

,

J. Graph Theory, 1996

A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1996

Independence number in n-extendable graphs.

[BibT_eX]

[DOI]

Peter Maschlanka

,

Discret. Math., 1996

Neighbourhood and degree conditions for the existence of regular factors.

[BibT_eX]

Ursala Lenkewitz

,

Ars Comb., 1996

A generalization of menger's theorem for certain block - cactus graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 1995

On graphs with equal domination and edge independence numbers.

[BibT_eX]

Ars Comb., 1995

New sufficient conditions for equality of minimum degree and edge-connectivity.

[BibT_eX]

,

Ars Comb., 1995

Tree-Ramsey numbers.

[BibT_eX]

[DOI]

Yabao Guo

,

Australas. J Comb., 1995

Connectivity properties of locally semicomplete digraphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1994

Cycles in Multipartite Tournaments.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1994

On unique independent sets in graphs.

[BibT_eX]

[DOI]

Werner Siemes

,

,

Discret. Math., 1994

On complementary cycles in locally semicomplete digraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1994

on Graphs with Equal Domination and Covering Numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A characterization of well covered block-cactus graphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 1994

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

[BibT_eX]

[DOI]

,

J. Graph Theory, 1993

A new domination conception.

[BibT_eX]

[DOI]

Christoph Stracke

,

J. Graph Theory, 1993

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

[BibT_eX]

[DOI]

,

Discret. Math., 1993

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]

,

Discret. Math., 1991

Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree.

[BibT_eX]

[DOI]

Thomas Niessen

,

J. Graph Theory, 1990

Estimations for the domination number of a graph.

[BibT_eX]

[DOI]

Peter Flach

,

Discret. Math., 1990

Edge-connectivity in p-partite graphs.

[BibT_eX]

[DOI]