A characterisation of domination perfect graphs

Zverovich, Vadim

Extending indoor open street mapping environments to navigable 3D citygml building models: Emergency response assessment (2018)
Presentation / Conference Contribution

© Authors 2018. Disaster scenarios in high-rise buildings such as the Address Downtown, Dubai or Grenfell Tower, London have showed ones again the importance of data information availability for emergency management in buildings. 3D visualization of... Read More about Extending indoor open street mapping environments to navigable 3D citygml building models: Emergency response assessment.

CUBER: Critical Urban Buildings Emergency Response (2016)
Presentation / Conference Contribution

When human-induced disasters (i.e. terrorist attacks, social unrest, fires), as well as natural disasters (i.e. floods, earthquake, climate change) take place in complex buildings, a short delay in response to an incident or a major event may mean a... Read More about CUBER: Critical Urban Buildings Emergency Response.

3D capture techniques for BIM enabled LCM (2016)
Presentation / Conference Contribution

© IFIP International Federation for Information Processing 2016. As a special kind of Product Life cyle Management (PLM), Building Life cycle Management (BLM) is a centric activity for facility owners and managers. This fact motivates the adoption of... Read More about 3D capture techniques for BIM enabled LCM.

Bounds and algorithms for limited packings in graphs (2014)
Presentation / Conference Contribution

Braess’ paradox in asymmetrical traffic networks (2014)
Presentation / Conference Contribution

Braess’ paradox illustrates situations when adding a new link to a transport network might lead to an equilibrium state in which travel times of users will increase. Braess’ paradox has been studied mainly in the context of the classical problem intr... Read More about Braess’ paradox in asymmetrical traffic networks.

Braess’ paradox in generalised traffic networks (2013)
Presentation / Conference Contribution

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Presentation / Conference Contribution

Randomized algorithms and upper bounds for multiple domination in graphs and networks (2013)
Presentation / Conference Contribution

We consider four different types of multiple domination and provide new improved upper bounds for the k- and k-tuple domination numbers. They generalize two classical bounds for the domination number and are better than a number of known upper bounds... Read More about Randomized algorithms and upper bounds for multiple domination in graphs and networks.

Upper bounds for the bondage number of graphs on topological surfaces (2011)
Presentation / Conference Contribution

Discrepancy theory and signed domination in graphs and hypergraphs (2009)
Presentation / Conference Contribution

Discrepancy and signed domination in graphs and hypergraphs (2009)
Presentation / Conference Contribution

Upper bounds for the alpha-domination number (2008)
Presentation / Conference Contribution

The k-tuple domination number revisited (2007)
Presentation / Conference Contribution

A proof of Rautenbach-Volkmann’s conjecture on k-tuple domination (2006)
Presentation / Conference Contribution

The computer system GRAPHOGRAPH (2006)
Presentation / Conference Contribution

A generalised upper bound for the k-tuple domination number (2005)
Presentation / Conference Contribution

Basic perfect graphs and their extensions (2005)
Presentation / Conference Contribution

In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti et al. (Square-free perfect graphs, J. Combin. Theory Ser. B, 90 (2) (2004) 257-307), and it plays... Read More about Basic perfect graphs and their extensions.

A characterisation of domination perfect graphs (2004)
Presentation / Conference Contribution

All Outputs (35)