Results 81 to 90 of about 1,282,765 (250)
Discrete Applied Mathematics, 2017 A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident to at most one crossing edge, and specializes 1-planarity, which only requires at most one crossing per ...
Franz J. Brandenburg +4 more
openaire +2 more sources
Vector Bond Graph Method of Kineto-static Analysis for Planar Multi-body System with Gear Pair
Jixie chuandong, 2015 In order to increase the reliability and efficiency of the kineto-static analysis of complex planar multi-body system,the corresponding vector bond graph method is proposed.According to the kinematic constraint condition,the vector bond graph model of a ...
Wang Zhongshuang +3 more
doaj
Degeneracies of Triangulated Graphs
Theory and Applications of GraphsA graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj +1 more source
On the Planarity of Generalized Line Graphs
Theory and Applications of Graphs, 2019 One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah +2 more
doaj +1 more source
Discrete Mathematics, 1976 AbstractIt is shown that every maximal planar graph (triangulation) can be contracted at an arbitrary point (by identifying it with an adjacent point) so that triangularity is preserved. This is used as a lemma to prove that every triangulation can be (a) oriented so that with three exceptions every point has indegree three, the exceptions having ...
openaire +3 more sources
2-distance 4-coloring of planar subcubic graphs with girth at least 21 [PDF]
Discrete Mathematics & Theoretical Computer ScienceA $2$-distance $k$-coloring of a graph is a proper vertex $k$-coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance $4$-coloring for planar subcubic graphs with girth at least 21. We also show
Hoang La, Mickael Montassier
doaj +1 more source
A Vector Bond Graph Method of Dynamics Modeling for Planar Multi-body Systems with Grooved Sheave
Jixie chuandong, 2017 In order to increase the reliability and efficiency of the dynamics modeling and analysis for complex planar multi-body systems containing grooved sheave,the corresponding vector bond graph procedure is proposed.
Wang Zhongshuang +2 more
doaj
Discrete Mathematics, 1996 We say the graph \(G= (V, E)\) is \(k\)-choosable if there is at least one \(L\)-list colouring for every possible list assignment \(L\) with \(|L(v)|= k\) for all \(v\in V\). \(G\) is called free \(k\)-choosable if such an \(L\)-list colouring exists for every list assignment \(L\), every vertex \(v\) and every colour \(f\in L(v)\).
openaire +2 more sources
On the reconstruction of planar graphs
Journal of Combinatorial Theory, Series B, 2007 AbstractWe show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.
Mark Bilinski +2 more
openaire +2 more sources
Journal of Combinatorial Theory, Series B, 1973 AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar.
openaire +3 more sources