Linear time recognition of P4-indifference graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has ...
Michel Habib +2 more
doaj +10 more sources
A Theorem on Indifference Graphs
The PUMP Journal of Undergraduate Research, 2021 An indifference graph P has as vertices a set of points on the real line, with an edge between every two points at most 1 apart. For every point x in P, we set N(x) to be the set of points that are adjacent to x. Fix an indifference graph P, and a positive integer k. Suppose that for every x in P, k divides |N(x)|.
Hilmer, Kieran +2 more
semanticscholar +5 more sources
Packing triangles in low degree graphs and indifference graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard.
Gordana Manić, Yoshiko Wakabayashi
doaj +6 more sources
Pairwise partition graphs and strategy-proof social choice in the exogenous indifference class model [PDF]
Social Choice and Welfare, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pramanik, Anup, Sen, Arunava
semanticscholar +5 more sources
Discrete Mathematics, 1982 AbstractLet G be a graph on v labelled vertices with E edges, without loops or multiple edges. Let v → ∞ and let E=E(v) be a function of v such that lim E(v)v23=c. The limit of the probability that a random graph is a unit interval graph, indifference graph or proper interval graph is exp(−43c3).
Joel E. Cohen
semanticscholar +3 more sources
A Symmetric Function of Increasing Forests [PDF]
Forum of Mathematics, Sigma, 2021 For an indifference graph G, we define a symmetric function of increasing spanning forests of G. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function and unicellular $\
Alex Abreu, Antonio Nigro
doaj +2 more sources
Indifference orders and split-indifference graphs: thirty years of productive collaborative work
Cadernos do IME - Série Informática, 2022 This is an account of our years as students of Jayme Luiz Szwarcfiter, during the years 1990. Two articles perfectly represent our experience as students, young researchers, and young authors.
Celina Figueiredo +2 more
openaire +2 more sources
On the Complexity of Nash Equilibria of Action-Graph Games [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2008 We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that encapsulates both "local" dependencies as in graphical games, and partial ...
Daskalakis, Constantinos +3 more
core +3 more sources
Analysis and synthesis of silhouettes of frontal - and flank-attacking shooting targets using graphs / Анализ и синтез силуэтов фронтальных и флангово-атакующих стрелковых мишеней с использованием графов / Analiza i sinteza silueta frontalnih i bočnih meta za gađanje pomoću grafova [PDF]
Vojnotehnički Glasnik, 2019 The goal of this contribution is to reveal the analytical framework and synthesis guidelines for frontal-attacking targets (FRATs) and flankattacking targets (FLATs) from the point of view of a graph as a mathematical object. The final outcome of this
Vadim L. Khaikov
doaj +2 more sources
On edge-colouring indifference graphs
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Figueiredo, Celina M.H. +2 more
+4 more sources