scientific article; zbMATH DE number 3257176
From MaRDI portal
Publication:5545303
zbMath0159.54403MaRDI QIDQ5545303
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On colorings and orientations of signed graphs, On \(\chi \)-diperfect digraphs with stability number two, 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, Ramsey numbers for tournaments, Directed Ramsey number for trees, Antidirected Hamiltonian paths in tournaments, Parameterized algorithms for feedback set problems and their duals in tournaments, Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths, On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, Acyclic subgraphs with high chromatic number, Weighted Rooted Trees: Fat or Tall?, Acyclic Orientations with Path Constraints, Paths with two blocks in \(k\)-chromatic digraphs, Antidirected paths in 5-chromatic digraphs, Trees contained in every orientation of a graph, Local \(k\)-colorings of graphs and hypergraphs, \( \chi \)-diperfect digraphs, Bispindles in strongly connected digraphs with large chromatic number, Oriented expressions of graph properties, On non-traceable, non-hypotraceable, arachnoid graphs, Graph saturation games, Ramsey-nice families of graphs, Motivations and history of some of my conjectures, On edge orienting methods for graph coloring, Mixed graph colorings, A Ramsey type result for oriented trees, Cycles of all lengths in arc-3-cyclic semicomplete digraphs, Variations on the Gallai-Milgram theorem, Monotone paths in ordered graphs, On the Turán number of some ordered even cycles, Independent sets which meet all longest paths, On properly ordered coloring of vertices in a vertex-weighted graph, Optimal colorings with rainbow paths, Problems on cycles and colorings, A supernodal formulation of vertex colouring with applications in course timetabling, Bispindle in strongly connected digraphs with large chromatic number, Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs, Paths with two blocks in \(n\)-chromatic digraphs, Shattering, graph orientations, and connectivity, The Ramsey numbers r(P\(_m\),K\(_n\)), Monochromatic paths in random tournaments, Chip-firing based methods in the Riemann-Roch theory of directed graphs, The size Ramsey number of a directed path, Unnamed Item, Characterizations of graphs having orientations satisfying local degree restrictions, Berge's conjecture on directed path partitions -- a survey, Extending the Greene-Kleitman theorem to directed graphs, Compact visibility representation of 4-connected plane graphs, Interleaved adjoints of directed graphs, The complexity of the proper orientation number, Colouring, constraint satisfaction, and complexity, Uncolorable mixed hypergraphs, k-optimal partitions of a directed graph, Topological additive numbering of directed acyclic graphs, Best monotone degree conditions for graph properties: a survey, Coloring digraphs with forbidden cycles, A dualistic approach to bounding the chromatic number of a graph, Subdivisions of four blocks cycles in digraphs with large chromatic number, On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem, On the strong and the semi-strong path partition conjecture, On Linial's conjecture for spine digraphs, Claws in digraphs, Gallai's problem on Dirac's construction, Variable space search for graph coloring, On the strong path partition conjecture of Berge, On Greene-Kleitman's theorem for general digraphs, Algorithms for computing a parameterized \(st\)-orientation, Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs, Monochromatic vs multicolored paths, Graph labellings with variable weights, a survey, Stable set meeting every longest path, On the Berge's strong path partition conjecture, Induced subgraphs of graphs with large chromatic number. XIII. New brooms, NP-completeness of st-orientations for plane graphs, Acyclic orientations of a graph and the chromatic and independence numbers, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), Unnamed Item, Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs, 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, Using stable sets to bound the chromatic number, Paths, cycles and circular colorings in digraphs, Monochromatic paths in edge-colored graphs, Chromatic number and orientations of graphs and signed graphs, Edmonds polytopes and a hierarchy of combinatorial problems, On Path Partitions and Colourings in Digraphs, Path Partitions, Cycle Covers and Integer Decomposition, Monochromatic trees in random tournaments, A Ramsey-type problem in directed and bipartite graphs, On three blocks paths \(P (k, l, r)\), Extending Greene's theorem to directed graphs, Hamiltonian paths in Cayley graphs, Diperfect graphs, Acyclic subgraphs of tournaments with high chromatic number, Tournaments and Semicomplete Digraphs, Lexicographic Orientation Algorithms, Some Ramsey nu mbers for directed graphs, Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number, Submodular functions and rooted trees, Density via duality., Obstructions for acyclic local tournament orientation completions, Covering and coloring problems for relatives of intervals, Cycles and new bounds for the chromatic number, Separating pairs of points of standard boxes
