Results 41 to 50 of about 113,121 (99)

Spaces of graphs, boundary groupoids and the coarse Baum-Connes conjecture

open access: yes, 2014
We introduce a new variant of the coarse Baum–Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum–Connes conjecture.
Wright, Nick, Finn-Sell, Martin
core   +1 more source

Extensions of Vizing fans and Vizing's Theorem in graph edge coloring [PDF]

open access: yes, 2022
Graph edge coloring is a well established subject in the field of graph theory. It is one of the basic combinatorial optimization problem: Color the edges of a graph $G$ with as few colors as possible such that each edge receives a color and adjacent ...
Qi, Xuli
core   +1 more source

Vizing's 2‐Factor Conjecture Involving Large Maximum Degree [PDF]

open access: yesJournal of Graph Theory, 2017
AbstractLet G be an n‐vertex simple graph, and let and denote the maximum degree and chromatic index of G, respectively. Vizing proved that or . Define G to be Δ‐critical if and for every proper subgraph H of G. In 1965, Vizing conjectured that if G is an n‐vertex Δ‐critical graph, then G has a 2‐factor.
Guantao Chen, Songling Shan
openaire   +4 more sources

On Strongly and Robustly Critical Graphs

open access: yesJournal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.
ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn   +3 more
wiley   +1 more source

Fuglede`s conjecture fails in dimension 4 [PDF]

open access: yes, 2005
In this note we modify a recent example of Tao and give an example of a set Omega subset of R-4 such that L-2(Omega) admits an orthonormal basis of exponentials {1/vertical bar Omega vertical bar 1/2 e(2 pi i )}(xi epsilon Lambda) for some set Lambda ...
Matolcsi, Máté
core   +1 more source

Partial product of graphs and Vizing's conjecture

open access: yesArs Mathematica Contemporanea, 2014
Let G and H be two graphs with vertex sets V 1  = { u 1 , . . . ,  u n 1 } and V 2  = { v 1 , . . . ,  v n 2 } , respectively. If S  ⊂  V 2 , then the partial Cartesian product of G and H with respect to S is the graph G □ S H  = ( V ,  E ) , where V  =  V 1  ×  V 2 and two vertices ( u i ,  v j
openaire   +4 more sources

Some results on Vizing’s conjecture and related problems

open access: yesDiscrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Pilipczuk   +2 more
openaire   +1 more source

Molecular investigation of the phylogenetic placement of Kartalinia and a revision of Bituminaria (Fabaceae: Psoraleeae)

open access: yesTAXON, Volume 75, Issue 4, August 2026.
Abstract The genus Kartalinia was described to accommodate a single, obscure species, Psoralea acaulis, based on its unique morphology and karyology. No concerted molecular phylogenetic studies were available for this species at the time, and therefore its phylogenetic position was uncertain.
Brian Du Preez   +4 more
wiley   +1 more source

Disentangling Counter‐Empathy: Developing a Three‐Dimensional Model and Measure of Dispositional Counter‐Empathy

open access: yesJournal of Personality, Volume 94, Issue 4, Page 584-601, August 2026.
ABSTRACT Objectives Counter‐empathy involves responding to others' assumed emotions incongruently. Research on dispositional counter‐empathy predominantly focuses on specific counter‐empathic constructs without clearly mapping its cardinal dimensions.
Jake R. Siamro, Christian H. Jordan
wiley   +1 more source

Generalized Foulkes' Conjecture and Tableaux Construction [PDF]

open access: yes, 2004
Foulkes conjectured that for n=ab and a ≤ b, every irreducible module occurring as a constituent in 1Sb∫SaSn occurs with greater or equal multiplicity in 1Sa∫SbSn.
Vessenes, Rebecca   +1 more
core   +1 more source

Home - About - Disclaimer - Privacy