On circuits and subgraphs of chromatic graphs
From MaRDI portal
Publication:3845890
DOI10.1112/S0025579300003260zbMath0109.16502OpenAlexW2127813745MaRDI QIDQ3845890
Publication date: 1962
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0025579300003260
Related Items
On the existence of two non-neighboring subgraphs in a graph, Almost all graphs with 1.44n edges are 3-colorable, On cutting-plane proofs in combinatorial optimization, On the growth rate of chromatic numbers of finite subgraphs, Local and global colorability of graphs, Two results on the digraph chromatic number, Comparing the strength of query types in property testing: the case of \(k\)-colorability, Chromatic number and girth, Local edge colouring of Yao-like subgraphs of unit disk graphs, How to make a graph bipartite, On chromatic number of graphs and set-systems
Cites Work
