The number of edges in critical graphs.

DOI10.1515/crll.1974.268-269.150zbMath0298.05119OpenAlexW4245048168MaRDI QIDQ4052158

G. A. Dirac

Publication date: 1974

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002189321

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Size, chromatic number, and connectivity ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ The wave function collapse as an effect of field quantization ⋮ On constructive methods in the theory of colour-critical graphs ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ Generalized DP-colorings of graphs ⋮ On the edge-density of 4-critical graphs ⋮ Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Coloring vertices and faces of maps on surfaces ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ On list critical graphs ⋮ Two definitions of a determinant and proof of the Szegoe-Kac theorem ⋮ Colour-critical graphs with few edges ⋮ Common space of spin and spacetime

This page was built for publication: The number of edges in critical graphs.