Results 11 to 20 of about 2,666,039 (345)
On the Hamiltonian Number of a Plane Graph [PDF]
Discussiones Mathematicae Graph Theory, 2019 The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +2 more sources
Every plane graph of maximum degree 8 has an edge-face 9-colouring [PDF]
SIAM Journal on Discrete Mathematics, 2011 An edge-face colouring of a plane graph with edge set $E$ and face set $F$ is a colouring of the elements of $E \cup F$ such that adjacent or incident elements receive different colours.
Kang, Ross J. +2 more
core +8 more sources
On the edge irregularity strength for some classes of plane graphs
AIMS Mathematics, 2021 Graph labeling is an assignment of (usually) positive integers to elements of a graph (vertices and/or edges) satisfying certain condition(s). In the last two decades, graph labeling research received much attention from researchers.
Ibrahim Tarawneh +3 more
doaj +2 more sources
Invariants of Graph Drawings in the Plane [PDF]
Arnold Mathematical Journal, 2020 48 pages, many figures.
A. Skopenkov
openaire +5 more sources
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time [PDF]
International Symposium Graph Drawing and Network Visualization, 2016 Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs,
A Grigoriev +12 more
core +2 more sources
On Transforming a Spatial Graph into a Plane Graph [PDF]
Progress of Theoretical Physics Supplement, 2011 This talk is an improved revision of the talk (see [1]) given at the workskp Knots and soft-matter physics, Kyoto, August, 2008 on a complexity of a spatial graph with an emphasis on a transformation of spatial graph into a plane graph. In a research of proteins, molecules, or polymers, it is important to understand geometrically and topologically ...
A. Kawauchi
openaire +3 more sources
The Odd-Distance Plane Graph [PDF]
Discrete & Computational Geometry, 2009 Hayri Ardal +4 more
openalex +2 more sources
Jet tagging in the Lund plane with graph networks [PDF]
Journal of High Energy Physics, 2020 The identification of boosted heavy particles such as top quarks or vector bosons is one of the key problems arising in experimental studies at the Large Hadron Collider.
F. Dreyer, H. Qu
semanticscholar +1 more source
Plane Geometry Diagram Parsing [PDF]
International Joint Conference on Artificial Intelligence, 2022 Geometry diagram parsing plays a key role in geometry problem solving, wherein the primitive extraction and relation parsing remain challenging due to the complex layout and between-primitive relationship.
Ming-Liang Zhang +3 more
semanticscholar +1 more source
Bend-optimal orthogonal drawings of triconnected plane graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A drawing of a plane graph G in which each edge is represented by a sequence of alternating horizontal and vertical line segments is called an orthogonal drawing.
Siddharth Bhatia, Kunal Lad, Rajiv Kumar
doaj +2 more sources