Zhang, LianzhuDiscrete MathematicsA note on the surviving rate of 1-planar graphs. Kong J X,Zhang L Z. Discrete Mathematics . 2017Kong J X, Zhang L Z. A note on the surviving rate of 1-planar graphs [J]. Discrete Math., 2017, 340: 1074-1079....
In this note we prove that every 1-planar graph admits an odd 23-coloring, where a graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. Introduction All graphs considered in this paper are simple, finite, and undirected. Let G ...
A note on odd colorings of 1-planar graphs A proper coloring of a graph is odd if every non-isolated vertex has some color that appears an odd number of times on its neighborhood. This notion was re... DW Cranston,M Lafferty,ZX Song - 《Discrete Applied Mathematics》 被引量: 0发表:...
In this note we present some properties of L1-embeddable planar graphs. We present a characterization of graphs isometrically embeddable into half-cubes. T... DV Grishukhin - 《Discrete Applied Mathematics》 被引量: 94发表: 1997年 A Note on l1-rigid Planar Graphs In this note we study scal...
A note on the edge choosability of $K_{5}$-minor free graphs For a planar graph G G , Borodin stated that G G is ( Δ + 1 ) (\\Delta+1) -edge-choosable if Δ≥ 9 \\Delta \\geq9 and later Bonamy showed that G G is... J Feng,J Wu,F Yang 被引量: 0发表: 2022年 加...
Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern
"A note on two problems in connexion with graphs." Numerische mathematik 1.1 (1959): 269-271. 🚘 Local Planner dwa_local_planner, teb_local_planner, base_local_planner, eband_local_planner, robotino_local_planner, asr_ftc_local_planner, simple_local_planner "Timed Elastic Band (TEB)": ...
We present an infinite family of finite planar graphs $\\{X_n\\}$ with degreeat most five and such that for some constant $c > 0$, $$ \\lambda_1(X_n) \\geqc(\\frac{\\log \\diam(X_n)}{\\diam(X_n)})^2\\,, $$ where $\\lambda_1$ denotes thesmallest non-zero ...
This class of graphs is particularly interesting since it proves the tightness of Robertson and Seymour’s [12] inequality 1+ω(G)≤32β(G) for planar graphs. Moreover, the same class of graphs provides the evidence of the tightness of another upper bound on the tree-width: Bodlaender [...
security engineering for machine learning (keynote) [Paper] trustworthy machine learning: fairness and robustness [Paper] hidden stratification causes clinically meaningful failures in machine learning for medical imaging [Paper] making machine learning robust against adversarial inputs [Paper] toward...