Results 61 to 70 of about 590 (74)
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
A note on nowhere-zero 3-flow and Z_3-connectivity
, 2014 There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conjecture that every 5-edge-connected graph is $Z_3$-connected and Kochol's ...
Chen, Fuyuan, Ning, Bo
core +1 more source
Discussiones Mathematicae Graph Theory, 2019 Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj +1 more source
Connectivity of Triangulation Flip Graphs in the Plane. [PDF]
Discrete Comput Geom, 2022 Wagner U, Welzl E.
europepmc +1 more source
The Path-Pairability Number of Product of Stars
Discussiones Mathematicae Graph Theory, 2019 The study of a graph theory model of certain telecommunications network problems lead to the concept of path-pairability, a variation of weak linkedness of graphs.
Jobson Adam S. +3 more
doaj +1 more source
Properties of uniformly $3$-connected graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths.
Frank Göring, Tobias Hofmann
doaj +1 more source
Structure of the space of taboo-free sequences. [PDF]
J Math Biol, 2020 Manuel C, von Haeseler A.
europepmc +1 more source
Forum of Mathematics, SigmaA classical problem, due to Gerencsér and Gyárfás from 1967, asks how large a monochromatic connected component can we guarantee in any r-edge colouring of $K_n$ ?
Noga Alon +3 more
doaj +1 more source
A Suzuki-type multivalued contraction on weak partial metric spaces and applications. [PDF]
J Inequal Appl, 2018 Aydi H +3 more
europepmc +1 more source
The F-coindex of some graph operations. [PDF]
Springerplus, 2016 De N, Nayeem SM, Pal A.
europepmc +1 more source