On splitting digraphs (Q1750217)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On splitting digraphs	scientific article

Statements

scholarly article

0 references

On splitting digraphs (English)

0 references

0 references

0 references

0 references

0 references

European Journal of Combinatorics

0 references

publication date

18 May 2018

0 references

full work available at URL

https://arxiv.org/abs/1707.03600

0 references

zbMATH Keywords

multipartite tournaments

0 references

MaRDI profile type

MaRDI publication profile

0 references

Splitting digraphs

0 references

Problems and results on judicious partitions

0 references

On bisections of directed graphs

0 references

Partitions of graphs with high minimum degree or connectivity.

0 references

Bisections of graphs

0 references

Judicious partitions of directed graphs

0 references

Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz

0 references

0 references

Graph colouring and the probabilistic method

0 references

0 references

A Relaxed Version of the Erdős–Lovász Tihany Conjecture

0 references

Disjoint cycles in digraphs

0 references

Even cycles in directed graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.EJC.2018.03.005

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1750217

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1750217&oldid=38728274"