Results 1 to 10 of about 1,013,923 (195)
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)|.
Kieran Hilmer +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 +5 more sources
Characterizing and edge-colouring split-indifference graphs
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Z. Carmen Ortiz +2 more
semanticscholar +4 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
The total chromatic number of split-indifference graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C.N. Campos +3 more
semanticscholar +4 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.
Anup Pramanik, Arunava Sen
semanticscholar +4 more sources
On edge-colouring indifference graphs
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Celina M.H. de Figueiredo +2 more
semanticscholar +3 more sources
Decompositions for the edge colouring of reduced indifference graphs
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Celina M.H. de Figueiredo +3 more
semanticscholar +4 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