Search
Search Results
-
-
Vertex-Coloring Graphs with 4-Edge-Weightings
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that...
-
A New Width Parameter of Graphs Based on Edge Cuts: \(\alpha \) -Edge-Crossing Width
We introduce graph width parameters, called \(\alpha \) -edge-crossing...
-
On the Edge-Erdős–Pósa Property of Ladders
We prove that the ladder with 3 rungs and the house graph have the edge-Erdős–Pósa property, while ladders with 14 rungs or more have not....
-
The Existence of Planar 4-Connected Essentially 6-Edge-Connected Graphs with No Claw-Decompositions
In 2006 Barát and Thomassen conjectured that every planar 4-edge-connected 4-regular simple graph of size divisible by three admits a...
-
-
-
Mesh orientation
Orienting the edges and the faces of a mesh is crucial when working with finite elements whose degrees of freedom invoke normal or tangential...
-
-
The Edge General Position Problem
Given a graph G , the general position problem is to find a largest set S of vertices of G such that no three vertices of S lie on a common geodesic....
-
Introducing edge-biregular maps
We introduce the concept of alternate-edge-colourings for maps and study highly symmetric examples of such maps. Edge-biregular maps of type ( k , l )...
-
Criterion for a graph to admit a good orientation in terms of leaf blocks
Given a set S of integers, for a directed acyclic pseudograph we say that it has an S -good orientation if all its sources and sinks have degrees in S ;...
-
An Application of Linear Diophantine Fuzzy Sets to the Edge Detection Techniques
The utilization of fuzzy set theory within the domain of image processing provides a lot of advantages such as encompassing the management of...
-
Hypergraph Edge Representations with the Use of Homological Paths
AbstractWe consider the problem of realization of hypergraphs on a graph provided each hyperedge is realized by a subgraph in which exactly two...
-
-
-
-
Separating bichromatic point sets in the plane by restricted orientation convex hulls
We explore the separability of point sets in the plane by a restricted-orientation convex hull , which is an orientation-dependent, possibly...
-
Modelling domain-wall orientation in antiferromagnets driven by magnetoelastic interactions and volume variations
In this paper, we build the mathematical framework to describe the physical phenomenon behind the equilibrium configuration joining two orthogonal...
-
Recent Geometric Flows in Multi-orientation Image Processing via a Cartan Connection
Applications of geometric flows to multi-orientation image processing require the choice of an (affine) connection on the Lie group G of...