Results 91 to 100 of about 215 (116)
Some of the next articles are maybe not open access.

On construction for trees making the equality hold in Vizing's conjecture

Journal of Graph Theory, 2022
AbstractIn 1968, Vizing gave a conjecture: for any graphs and , which is now still open. In the text book “Domination in Graph: Advanced Topices” edited by Haynes et al., they listed such a question: is there a structural characterization of the graphs such that there exists a graph with ?
Weisheng Zhao, Ruizhi Lin, Junqing Cai
openaire   +1 more source

Some improved inequalities related to Vizing's conjecture

Information Processing Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pei, Li-Dan, Pan, Xiang-Feng, Hu, Fu-Tao
openaire   +2 more sources

Vizing's conjecture: a survey and recent results

Journal of Graph Theory, 2011
AbstractVizing's conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this paper we survey the approaches to this central conjecture from domination theory and give some new results along the way.
Brešar, Boštjan   +6 more
openaire   +1 more source

Reducing Vizing’s 2-Factor Conjecture to Meredith Extension of Critical Graphs

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaodong, Ji, Qing, Liu, Mingda
openaire   +2 more sources

Domination and Vizing’s Conjecture

2023
Teresa W. Haynes   +2 more
openaire   +1 more source

Weak gravity conjecture

Reviews of Modern Physics, 2023
Ben Heidenreich   +2 more
exaly  

The Weak Gravity Conjecture and BPS Particles

Fortschritte Der Physik, 2021
Ben Heidenreich, Tom Rudelius
exaly  

Normal Scalar Curvature Conjecture and its applications

Journal of Functional Analysis, 2011
Zhiqin Lu
exaly  

The weak 3-flow conjecture and the weak circular flow conjecture

Journal of Combinatorial Theory Series B, 2012
Carsten Thomassen
exaly  

Home - About - Disclaimer - Privacy