Indivisible homogeneous directed graphs and a game for vertex partitions (original) (raw)

The indivisibility of the homogeneous Kn-free graphs

Mohamed Elzahar

Journal of Combinatorial Theory, Series B, 1989

View PDFchevron_right

Partitioning Transitive Tournaments into Isomorphic Digraphs

Gábor Tardos

Order

View PDFchevron_right

A note on vertex partitions

Landon Rabern

View PDFchevron_right

A Graph Partition Problem

Peter Cameron

The American Mathematical Monthly, 2015

View PDFchevron_right

Perfect Graphs, Partitionable Graphs and Cutsets

Kristina Vuskovic

Combinatorica, 2002

View PDFchevron_right

Equitable Bipartitions of Graphs and Related Results

Paula Rama

Journal of Mathematical Sciences, 2004

View PDFchevron_right

Zero-sum partition theorems for graphs

Yair Caro

International Journal of Mathematics and Mathematical Sciences, 1994

View PDFchevron_right

Indivisibility for Classes of Graphs

Christian Pippin

arXiv (Cornell University), 2023

View PDFchevron_right

A Ramsey-type problem in directed and bipartite graphs

Jeno Lehel

Periodica Mathematica Hungarica, 1973

View PDFchevron_right

Vertex-disjoint cycles in bipartite tournaments

Mika Olsen

Electronic Notes in Discrete Mathematics, 2016

View PDFchevron_right

Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments

Mika Olsen

Discret. Math. Theor. Comput. Sci., 2018

View PDFchevron_right

On Satisfactory Partitioning of Graphs

Khurram Shafique

2002

View PDFchevron_right

Perfect graphs, kernels, and cores of cooperative games

Vladimir Gurvich

Discrete Mathematics, 2006

View PDFchevron_right

Necessary and sufficient conditions for balancedness in partitioning games

Thomas Quint

Mathematical Social Sciences, 1991

View PDFchevron_right

The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs

Andres Aranda

European Journal of Combinatorics, 2020

View PDFchevron_right

On Point-Symmetric Tournaments

Brian Alspach

Canadian mathematical bulletin, 1970

View PDFchevron_right

Forbidding Couples of Tournaments and the Erdös-Hajnal Conjecture

Soukaina Zayat

View PDFchevron_right

Vertex disjoint 4-cycles in bipartite tournaments

Mika Olsen

Discrete Mathematics

View PDFchevron_right

The number of -free vertices on 3-partite tournaments

Ana Paulina Figueroa

Discrete Mathematics, 2010

View PDFchevron_right

Compact graphs and equitable partitions

Chris Godsil

Linear Algebra and its Applications, 1997

View PDFchevron_right

On the structure of arbitrarily partitionable graphs with given connectivity

Olivier Baudon

Discrete Applied Mathematics, 2014

View PDFchevron_right

Partitioning a graph into alliance free sets

Khurram Shafique

Discrete Mathematics, 2009

View PDFchevron_right

On minimal arbitrarily partitionable graphs

Olivier Baudon

Information Processing Letters, 2012

View PDFchevron_right

Erdös-Hajnal Conjecture for New Infinite Families of Tournaments

Salman Ghazal

View PDFchevron_right

The directed path partition conjecture

Ortrud Oellermann

Discussiones Mathematicae Graph Theory, 2005

View PDFchevron_right

Decomposability and co-modular indices of tournaments

Houmem Belkhechine

Discrete Mathematics, 2021

View PDFchevron_right

On the Cartesian product of an arbitrarily partitionable graph and a traceable graph

Olivier Baudon

2015

View PDFchevron_right

Tournaments and the Erd\"{o}s-Hajnal Conjecture

Soukaina Zayat

2020

View PDFchevron_right

The order of uniquely partitionable graphs

Marietjie Frick

Discussiones Mathematicae Graph Theory, 1997

View PDFchevron_right

Decomposition of balanced multipartite tournaments into strongly connected tournaments

Mika Olsen

2018

View PDFchevron_right

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph

Olivier Baudon

Discrete Mathematics & Theoretical Computer Science, 2014

View PDFchevron_right

A polynomial characterization of some graph partitioning problems

Claudio Arbib

Information Processing Letters, 1988

View PDFchevron_right