Degree sequences in triangle-free graphs

DOI10.1016/0012-365X(91)90269-8MaRDI QIDQ1182926zbMATH OpenOpenAlexWikidataFDO

Authors Siemion Fajtlowicz, William Staton, P. Erdős

Publication date 28 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(91)90269-8

zbMATH Keywords

chromatic numberdegree sequencestriangle-free graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Recommendations

• On the chromatic number of triangle-free graphs of large minimum degree
• Triangle-free graphs with large chromatic numbers
• A 4-colour problem for dense triangle-free graphs
• Triangle-Free Graphs with Large Degree
• On degree sums of a triangle-free graph

Cited in

(8)

• Independent sets and repeated degrees
• Degree multiplicities and independent sets in \(K_ 4\)-free graphs
• Degree sequence and independence in K(4)-free graphs
• Degree sequences of \(F\)-free graphs
• Large induced subgraphs with three repeated degrees
• 3-connected graphs and their degree sequences
• On triangular biregular degree sequences
• A note on forcing 3-repetitions in degree sequences

This page was built for publication: Degree sequences in triangle-free graphs

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