scientific article; zbMATH DE number 3257176

Cited in

(only showing first 100 items - show all)

Using stable sets to bound the chromatic number
Paths, cycles and circular colorings in digraphs
Hamiltonian paths in Cayley graphs
Covering and coloring problems for relatives of intervals
Separating pairs of points of standard boxes
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
Local k-colorings of graphs and hypergraphs
Variations on the Gallai-Milgram theorem
Extending the Greene-Kleitman theorem to directed graphs
k-optimal partitions of a directed graph
Gallai's problem on Dirac's construction
Monochromatic vs multicolored paths
On the Berge's strong path partition conjecture
Acyclic orientations of a graph and the chromatic and independence numbers
Motivations and history of some of my conjectures
Mixed graph colorings
Cycles of all lengths in arc-3-cyclic semicomplete digraphs
The Ramsey numbers r(P\(_m\),K\(_n\))
Acyclic subgraphs with high chromatic number
Bispindles in strongly connected digraphs with large chromatic number
Ramsey-nice families of graphs
On the Turán number of some ordered even cycles
Stable set meeting every longest path
Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs
Extending Greene's theorem to directed graphs
Diperfect graphs
Some Ramsey nu mbers for directed graphs
Density via duality.
Paths with two blocks in k-chromatic digraphs
Antidirected paths in 5-chromatic digraphs
Independent sets which meet all longest paths
Uncolorable mixed hypergraphs
On the strong and the semi-strong path partition conjecture
Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
Induced subgraphs of graphs with large chromatic number. XIII. New brooms
Structure and colour in triangle-free graphs
Increasing paths in countable graphs
The trouble with the second quantifier
Duality pairs and homomorphisms to oriented and unoriented cycles
On three blocks paths \(P (k, l, r)\)
Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
Submodular functions and rooted trees
Obstructions for acyclic local tournament orientation completions
Cycles and new bounds for the chromatic number
Trees contained in every orientation of a graph
\( \chi \)-diperfect digraphs
Oriented expressions of graph properties
Subdivisions of four blocks cycles in digraphs with large chromatic number
NP-completeness of st-orientations for plane graphs
Chromatic number and orientations of graphs and signed graphs
Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
On edge orienting methods for graph coloring
Optimal colorings with rainbow paths
Bispindle in strongly connected digraphs with large chromatic number
Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs
Chip-firing based methods in the Riemann-Roch theory of directed graphs
Berge's conjecture on directed path partitions -- a survey
The complexity of the proper orientation number
A dualistic approach to bounding the chromatic number of a graph
Claws in digraphs
Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
Monochromatic paths in edge-colored graphs
Edmonds polytopes and a hierarchy of combinatorial problems
A Ramsey-type problem in directed and bipartite graphs
On properly ordered coloring of vertices in a vertex-weighted graph
Tournaments and Semicomplete Digraphs
Lexicographic orientation algorithms
Acyclic orientations with path constraints
On non-traceable, non-hypotraceable, arachnoid graphs
Graph saturation games
A Ramsey type result for oriented trees
On path partitions and colourings in digraphs
Path Partitions, Cycle Covers and Integer Decomposition
scientific article; zbMATH DE number 4077268 (Why is no real title available?)
Problems on cycles and colorings
Shattering, graph orientations, and connectivity
The size Ramsey number of a directed path
Characterizations of graphs having orientations satisfying local degree restrictions
scientific article; zbMATH DE number 1039106 (Why is no real title available?)
Compact visibility representation of 4-connected plane graphs
Colouring, constraint satisfaction, and complexity
Topological additive numbering of directed acyclic graphs
Best monotone degree conditions for graph properties: a survey
Coloring digraphs with forbidden cycles
Monochromatic trees in random tournaments
Acyclic subgraphs of tournaments with high chromatic number
scientific article; zbMATH DE number 7370928 (Why is no real title available?)
Weighted Rooted Trees: Fat or Tall?
scientific article; zbMATH DE number 7560305 (Why is no real title available?)
On Linial's conjecture for spine digraphs
Antidirected Hamiltonian paths in tournaments
Monotone paths in ordered graphs
Ramsey numbers for tournaments
On colorings and orientations of signed graphs
On -diperfect digraphs with stability number two
A supernodal formulation of vertex colouring with applications in course timetabling
The existence of a path with two blocks in digraphs
Congruence of cycle lengths and chromatic number
Existence of paths with t blocks in k ( t )-chromatic digraph
Interleaved adjoints of directed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545303)