Results 191 to 200 of about 573 (222)
Some of the next articles are maybe not open access.

On the critical graph conjecture

Journal of Graph Theory, 1980
AbstractGol'dberg has recently constructed an infinite family of 3‐critical graphs of even order. We now prove that if there exists a p(≥4)‐critical graph K of odd order such that K has a vertex u of valency 2 and another vertex v ≠ u of valency ≤(p + 2)/2, then there exists a p‐critical graph of even order.
openaire   +2 more sources

Three Conjectures on Critical Graphs

The American Mathematical Monthly, 1976
(1976). Three Conjectures on Critical Graphs. The American Mathematical Monthly: Vol. 83, No. 2, pp. 128-129.
Robin J. Wilson, Lowell W. Beineke
openaire   +1 more source

A conjecture on k-factor-critical and 3-γ-critical graphs

Science China Mathematics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Tao, Yu, Qinglin
openaire   +2 more sources

Mader’s Conjecture On Extremely Critical Graphs

Combinatorica, 2006
A non-complete graph G is called an (n,k)-graph if it is n-connected but G—X is not (n−|X|+1)-connected for any X ⊂ V (G) with |X|≤k. Mader conjectured that for k≥3 the graph K2k+2−(1−factor) is the unique (2k,k)-graph(up to isomorphism).Here we prove this conjecture.
openaire   +1 more source

Conjecture and Criticism in Religious Belief

Religious Studies, 1979
Accounts of religion, like almost all influential academic and intellectual exercises, as indeed much else, in the last two or three centuries, have generally been the work of Western scholars and intellectuals, often less familiar with, but sometimes simply disinclined to take seriously, non-Western religious traditions.
openaire   +1 more source

On a Conjecture about the Critical Points of a Polynomial

1985
By a “circular domain” we shall mean a domain in ℂ whose boundary is a circle or a straight line. By D(a;η) we shall denote the open disk {z ∈ ℂ : ∣z−a∣< η} and by D(a;η) its closure.
B. D. Bojanov, Q. I. Rahman, J. Szynal
openaire   +1 more source

All My Favorite Conjectures Are Critical

2016
My favorite graph theory conjectures involve the effects of edge removal on the diameter of a graph and the effects of edge addition on the domination and total domination numbers of a graph. Loosely speaking, “criticality” means that the value of the parameter in question always changes under the graph modification.
openaire   +1 more source

Conjectural speech acts in Cuzco Quechua

Journal of Pragmatics, 2023
Martina Faller
exaly  

The Critical Index of Brouwer’s conjecture

European Journal of Combinatorics
Guilherme Torres, Vilmar Trevisan
openaire   +1 more source

Home - About - Disclaimer - Privacy