Results 101 to 110 of about 1,022,735 (236)

Criticality of Measures on 2-d Ising Configurations: From Square to Hexagonal Graphs [PDF]

, 2019
Valentina Apollonio, Roberto D’Autilia, Benedetto Scoppola, Elisabetta Scoppola, Alessio Troiani   +4 more
openalex   +1 more source

On the Independence Number of Edge Chromatic Critical Graphs

Discussiones Mathematicae Graph Theory, 2014
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree △ and independence number α (G), α (G) ≤. It is known that α (G) < |V |. In this paper we improve this bound when △≥ 4.
Pang Shiyou, Miao Lianying, Song Wenyao, Miao Zhengke   +3 more
doaj   +1 more source

Strengthening the Murty–Simon conjecture on diameter 2 critical graphs [PDF]

, 2019
Antoine Dailly, Florent Foucaud, Adriana Hansberg   +2 more
openalex   +1 more source

Critical Graphs for R(Pn, Pm) and the Star-Critical Ramsey Number for Paths

Discussiones Mathematicae Graph Theory, 2015
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H.
Hook Jonelle
doaj   +1 more source

On k-factor-critical graphs

Discussiones Mathematicae Graph Theory, 1996
Summary: A graph is said to be \(k\)-factor-critical if the removal of any set of \(k\) vertices results in a graph with a perfect matching. We study some properties of \(k\)-factor-critical graphs and show that many results on \(q\)-extendable graphs can be improved using this concept.
openaire   +2 more sources

Critical density of activated random walks on transitive graphs [PDF]

, 2018
Alexandre Stauffer, Lorenzo Taggi
openalex   +1 more source

On the critical group of the missing Moore graph [PDF]

, 2016
Joshua E. Ducey
openalex   +1 more source

Making a Graph Crossing-Critical by Multiplying its Edges [PDF]

, 2013
Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar   +2 more
openalex   +1 more source

RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS

, 2023
A. J. Mathias, V. Sangeetha, M. Acharya
openalex   +1 more source

Tight toughness bounds for path-factor critical avoidable graphs

AKCE International Journal of Graphs and Combinatorics
Given a graph G and an integer [Formula: see text], a spanning subgraph H of G is called a [Formula: see text]-factor of G if every component of H is a path with at least k vertices.
Wenqi Wang, Guowei Dai
doaj   +1 more source