Results 211 to 220 of about 1,022,735 (236)
Some of the next articles are maybe not open access.
Paired Domination Vertex Critical Graphs
Graphs and Combinatorics, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hou, Xinmin, Edwards, Michelle
openaire +2 more sources
Journal of Graph Theory, 2002
AbstractP. Erdős conjectured in [2] that r‐regular 4‐critical graphs exist for every r ≥ 3 and noted that no such graphs are known for r ≥ 6. This article contains the first example of a 6‐regular 4‐critical graph. © 2002 Wiley Periodicals, Inc.
openaire +1 more source
AbstractP. Erdős conjectured in [2] that r‐regular 4‐critical graphs exist for every r ≥ 3 and noted that no such graphs are known for r ≥ 6. This article contains the first example of a 6‐regular 4‐critical graph. © 2002 Wiley Periodicals, Inc.
openaire +1 more source
Critical Point-Arboritic Graphs
Journal of the London Mathematical Society, 1975Kronk, Hudson V., Mitchem, John
openaire +1 more source
Total domination edge critical graphs
1998A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if for each \(x\in V(G)\) there exists a vertex \(y\in D\) adjacent to \(x\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
Van Der Merwe, L. C. +2 more
openaire +1 more source
On critically hamiltonian graphs
Acta Mathematica Academiae Scientiarum Hungaricae, 1977openaire +1 more source
Distinct Classes of Complex Structural Variation Uncovered across Thousands of Cancer Genome Graphs
Cell, 2020Kevin Hadi +2 more
exaly