scientific article; zbMATH DE number 3205929

zbMath0126.39302MaRDI QIDQ5331780

I. Vitaver

Publication date: 1962

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Boolean powers of adjacency matrixminimal colorings for vertices of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (22)

Trees contained in every orientation of a graph ⋮ Bispindles in strongly connected digraphs with large chromatic number ⋮ Oriented expressions of graph properties ⋮ Mixed graph colorings ⋮ On properly ordered coloring of vertices in a vertex-weighted graph ⋮ A note on orientation and chromatic number of graphs ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Monochromatic paths in random tournaments ⋮ Unnamed Item ⋮ Many Facets of Dualities ⋮ Path homomorphisms, graph colorings, and boolean matrices ⋮ Structure and colour in triangle-free graphs ⋮ Metamathematical approach to proving theorems of discrete mathematics ⋮ A proof-scheme in discrete mathematics ⋮ The trouble with the second quantifier ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles ⋮ Chromatic number and orientations of graphs and signed graphs ⋮ The application of the methods of the theory of logical derivation to graph theory ⋮ Monochromatic trees in random tournaments ⋮ Tournaments and Semicomplete Digraphs ⋮ Lexicographic Orientation Algorithms ⋮ Obstructions for acyclic local tournament orientation completions

This page was built for publication: