Maximal colourings for graphs
From MaRDI portal
Publication:6616430
DOI10.1007/S00373-024-02823-3zbMATH Open1548.05134MaRDI QIDQ6616430
Could not fetch data.
Publication date: 9 October 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Colouring problems
- Graphok és alkalmazásuk a determinánsok és a halmazok elméletére. (Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.).
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Cycles of even length in graphs
- Francis Guthrie: a colourful life
- Some spectral properties of the non-backtracking matrix of a graph
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Properties determined by the Ihara zeta function of a graph
- Spectral redemption in clustering sparse networks
- Ramanujan graphings and correlation decay in local algorithms
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
- Eigenvalues of the non-backtracking operator detached from the bulk
- Beyond non-backtracking: non-cycling network centrality measures
- There is no going back: properties of the non-backtracking Laplacian
- Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs
- Spectral theory of the non-backtracking Laplacian for graphs
- On an estimate of the chromatic class of a \(p\)-graph
This page was built for publication: Maximal colourings for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616430)
