Results 101 to 110 of about 8,970,965 (255)
The upper chromatic number of quasi-interval co-hypergraphs
Le Matematiche, 1997 We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj
Finding Large Clique Minors is Hard
Journal of Graph Algorithms and Applications, 2009 We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor.
David Eppstein
doaj +1 more source
A New Spectral Bound on the Clique Number of Graphs
, 2010 Many computer vision and patter recognition problems are intimately related to the maximum clique problem. Due to the intractability of this problem, besides the development of heuristics, a research direction consists in trying to find good bounds on ...
Pelillo M +5 more
core +1 more source
A Structural Description of Zykov and Blanche Descartes Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Around 1950, Zykov and Blanche Descartes proposed the two first explicit constructions of triangle‐free graphs with arbitrarily large chromatic number. We define a Zykov (resp. Blanche Descartes) graph as any induced subgraph of a graph created using Zykov's construction (resp. Blanche Descartes's).
Malory Marin +3 more
wiley +1 more source
Disrupting the Chain of Displaced Aggression: A Review and Agenda for Future Research
Journal of Organizational Behavior, EarlyView.ABSTRACT Displaced aggression refers to instances in which a person redirects their harm‐doing behavior from a primary to a secondary, substitute target. Since the publication of the first empirical article in 1948, there has been a noticeable surge in research referencing this theory in both management and psychology journals.
Constantin Lagios +4 more
wiley +1 more source
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.
Marcin Pilipczuk, Paweł Rzążewski
doaj +1 more source
Journal of Organizational Behavior, EarlyView.ABSTRACT Subgroups are dynamic entities evolving constantly in response to changing contexts and time. Although scholars from both the attribute and the network views have acknowledged that subgroups are inherently complex and fluid, research in these traditions has remained bifurcated, with limited efforts to integrate the two perspectives to more ...
Jinhee Moon +3 more
wiley +1 more source
AKCE International Journal of Graphs and CombinatoricsThe computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking.
Ying Wang +5 more
doaj +1 more source
Journal of Organizational Behavior, EarlyView.ABSTRACT People with disabilities (PWD) often face barriers to inclusion at work. To tackle this challenge, past research focused on the role of organizations to create more inclusive workplaces. What remains understudied, however, is the role that PWD often take themselves in shaping their inclusion experiences.
Louisa Antonia Riess +2 more
wiley +1 more source
Workplace Allyship: An Integrative Review and Agenda for Future Research
Journal of Organizational Behavior, EarlyView.ABSTRACT Workplace allyship has emerged as a key construct in the literature on diversity, equity, and inclusion. Although research on workplace allyship has expanded rapidly in recent years, advancement in this research stream is limited by conceptual ambiguity and fragmentation across numerous perspectives.
Maria Funk +2 more
wiley +1 more source