Spectral extremal problem on disjoint color-critical graphs
From MaRDI portal
Publication:6197796
DOI10.37236/12245WikidataQ129285341 ScholiaQ129285341MaRDI QIDQ6197796
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Turán numbers for even wheels
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectra of graphs
- A contribution to the Zarankiewicz problem
- Spectral radius of graphs with given matching number
- The spectral radius of graphs without paths and cycles of specified length
- Spectral saturation: inverting the spectral Turán theorem
- Spectral bounds for the clique and independence numbers of graphs
- Degrees and matchings
- Spectral extremal results with forbidding linear forests
- The spectral radius of graphs without long cycles
- Spectral extremal graphs for intersecting cliques
- The maximum spectral radius of graphs without friendship subgraphs
- Adjacency eigenvalues of graphs without short odd cycles
- The spectral radius of graphs with no odd wheels
- A spectral condition for odd cycles in non-bipartite graphs
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Spectral extrema for graphs: the Zarankiewicz problem
- Bounds on graph eigenvalues. II
- A spectral condition for odd cycles in graphs
- Large cycles in graphs
- Cliques and the spectral radius
- On the spectral radius of graphs without a star forest
- Spectral extremal graphs for disjoint cliques
- Some new results in extremal graph theory
- Stability for large forbidden subgraphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Independent Complete Subgraphs in a Graph
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
This page was built for publication: Spectral extremal problem on disjoint color-critical graphs
