The number of edges in critical graphs.

DOI10.1515/CRLL.1974.268-269.150MaRDI QIDQ4052158zbMATH OpenOpenAlexFDO

Authors 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, https://eudml.org/doc/151457

Mathematics Subject Classification ID

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

Cited in

(18)

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

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

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