Reducing Vizing’s 2-Factor Conjecture to Meredith Extension of Critical Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-020-02191-8
Abstract: A simple graph G is called $$\varDelta$$ Δ - critical if $$\chi '(G) =\varDelta (G) +1$$ χ ′ ( G ) = Δ ( G ) + 1 and $$\chi '(H) \le \varDelta (G)$$ χ… read more here.
Keywords: conjecture; critical graph; meredith extension; vardelta ... See more keywords
List 2-distance $$\varDelta +3$$Δ+3-coloring of planar graphs without 4,5-cycles
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0312-8
Abstract: Let $$\chi _2(G)$$χ2(G) and $$\chi _2^l(G)$$χ2l(G) be the 2-distance chromatic number and list 2-distance chromatic number of a graph G, respectively. Wegner conjectured that for each planar graph G with maximum degree $$\varDelta $$Δ at… read more here.
Keywords: distance; list distance; without cycles; vardelta ... See more keywords
Relative uniform convergence of difference double sequence of positive linear functions
Sign Up to like & getrecommendations! Published in 2021 at "Ricerche di Matematica"
DOI: 10.1007/s11587-021-00613-0
Abstract: In this article we introduce the notion of relative uniform convergence of difference double sequence of positive linear functions. We define the difference double sequence spaces $$_2\ell _\infty (\varDelta , ru),~ _2c(\varDelta , ru),~ _2c_0(\varDelta… read more here.
Keywords: vardelta vardelta; difference double; vardelta; double sequence ... See more keywords