Results 81 to 90 of about 6,219 (246)
Signaling Effects of Women's Quotas: An Analysis of Workforce Perceptions and Reactions
Human Resource Management, EarlyView.ABSTRACT Women's quotas are widely used to promote gender equality in organizations, yet little is known about how the general workforce perceives and reacts to them. Drawing on signaling theory, we examine employees' awareness of women's quotas and how it influences their reactions.
Madleen Meier‐Barthold +1 more
wiley +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
The Scheduling Model Based on Precedents
Цифровая трансформация, 2015 The paper presents an approach for university scheduling based on precedents. The model is based on the mathematical apparatus of the theory of graphs. The model uses the principles of finding and proof of the graph isomorphism. The process of finding of
S. Nesterenkov
doaj +2 more sources
Tits alternatives for graph products
, 2015 We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group satisfies this ...
Antolin, Yago, Minasyan, Ashot
core +1 more source
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs [PDF]
, 2016 Given two graphs, Subgraph Isomorphism is the problem of deciding whether the first graph (the base graph) contains a subgraph isomorphic to the second graph (the pattern graph).
Otachi, Yota +2 more
core +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
Discrete Mathematics, 1984 A 4-isomorphism of two graphs G, G' is a bijection \(\phi:E(G)\to E(G')\) such that both \(\phi\) and \(\phi^{-1}\) preserve homeomorphs of \(K_ 4\). It is proved that each 4-isomorphism between 4-connected graphs is induced by a (usual) graph isomorphism.
openaire +2 more sources
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
The Maximum Common Subgraph Problem: A Parallel and Multi-Engine Approach
Computation, 2020 The maximum common subgraph of two graphs is the largest possible common subgraph, i.e., the common subgraph with as many vertices as possible. Even if this problem is very challenging, as it has been long proven NP-hard, its countless practical ...
Stefano Quer +2 more
doaj +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source