Results 11 to 20 of about 1,156,434 (264)
The maximum likelihood degree of toric varieties [PDF]
Journal of Symbolic Computation, 2019 21 pages, 5 ...
Améndola, Carlos +8 more
openaire +4 more sources
Maximum average degree and relaxed coloring [PDF]
Discrete Mathematics, 2017 4 ...
Michael Kopreski, Gexin Yu
openaire +5 more sources
Acyclic Coloring of Graphs of Maximum Degree $\Delta$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 An acyclic coloring of a graph $G$ is a coloring of its vertices such that: (i) no two neighbors in $G$ are assigned the same color and (ii) no bicolored cycle can exist in $G$.
Guillaume Fertin, André Raspaud
doaj +1 more source
Reducing the maximum degree of a graph: comparisons of bounds
Theory and Applications of Graphs, 2021 Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree.
Peter Borg
doaj +1 more source
Strong Immersions and Maximum Degree [PDF]
SIAM Journal on Discrete Mathematics, 2014 10 ...
Zdeněk Dvořák, Tereza Klimošová
openaire +2 more sources
Chromatic index, treewidth and maximum degree [PDF]
Electronic Notes in Discrete Mathematics, 2016 We conjecture that any graph $G$ with treewidth $k$ and maximum degree $\Delta(G)\geq k + \sqrt{k}$ satisfies $\chi'(G)=\Delta(G)$. In support of the conjecture we prove its fractional version. We also show that any graph $G$ with treewidth $k\geq 4$ and maximum degree $2k-1$ satisfies $\chi'(G)=\Delta(G)$, extending an old result of Vizing.
Bruhn, Henning +2 more
openaire +3 more sources
Graph realizations: Maximum degree in vertex neighborhoods
Discrete Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amotz Bar-Noy +3 more
openaire +4 more sources
The Maximum Degree of Series-Parallel Graphs [PDF]
Combinatorics, Probability and Computing, 2011 We prove that the maximum degree Δnof a random series-parallel graph withnvertices satisfies Δn/logn→cin probability, andΔn~clognfor a computable constantc> 0. The same kind of result holds for 2-connected series-parallel graphs, for outerplanar graphs, and for 2-connected outerplanar graphs.
Drmota, Michael +2 more
openaire +4 more sources
Equating κ Maximum Degrees in Graphs without Short Cycles
Discussiones Mathematicae Graph Theory, 2020 For an integer k at least 2, and a graph G, let fk(G) be the minimum cardinality of a set X of vertices of G such that G − X has either k vertices of maximum degree or order less than k.
Fürst Maximilian +4 more
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source