Degree sequences and chromatic numbers of graphs
From MaRDI portal
Publication:1865147
DOI10.1007/S003730200044zbMATH Open1009.05046OpenAlexW1999014354MaRDI QIDQ1865147FDOQ1865147
Authors: N. Punnim
Publication date: 25 March 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200044
Recommendations
Cited In (9)
- Title not available (Why is that?)
- Interpolation theorems for the arboricity and the vertex arboricity of graphs
- Degree sequences of \(F\)-free graphs
- Hadwiger number and chromatic number for near regular degree sequences
- Title not available (Why is that?)
- Covering the vertex set of a graph with subgraphs of smaller degree
- Chromatic number and complete graph substructures for degree sequences
- The clique numbers of regular graphs
- Extremal values of the chromatic number for a given degree sequence
This page was built for publication: Degree sequences and chromatic numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865147)