Chromatic number, independence ratio, and crossing number
From MaRDI portal
(Redirected from Publication:3535837)
Recommendations
- Chromatic number, induced cycles, and non-separating cycles
- Total chromatic number and some topological indices
- Generalizations of independence and chromatic numbers of a graph
- scientific article; zbMATH DE number 4150201
- Independence numbers and chromatic numbers of some distance graphs
- Chromatic number and Hamiltonicity of graphs
- Chromatic number and some multiplicative vertex-degree-based indices of graphs
- Independence, irredundance, degrees and chromatic number in graphs
- Chromatic numbers in some graphs
- A note on the chromatic and independence number of a graph
Cited in
(42)- Rank, term rank, and chromatic number
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
- Acyclic edge coloring of IC-planar graphs
- The maximal 1-planarity and crossing numbers of graphs
- A sufficient condition for an IC-planar graph to be class 1
- Adjacent vertex distinguishing edge coloring of IC-planar graphs
- Neighbor sum distinguishing total coloring of IC-planar graphs
- An improved upper bound for the acyclic chromatic number of 1-planar graphs
- On \((p, 1)\)-total labelling of NIC-planar graphs
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Remarks on the joins of 1-planar graphs
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
- Linear arboricity of NIC-planar graphs
- Equitable partition of plane graphs with independent crossings into induced forests
- Acyclic coloring of IC-planar graphs
- An annotated bibliography on 1-planarity
- \(\mathsf{NIC}\)-planar graphs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- \((k,p)\)-planarity: a relaxation of hybrid planarity
- On morphing 1-planar drawings
- Coloring plane graphs with independent crossings
- Recognizing IC-planar and NIC-planar graphs
- IC-planar graphs are 6-choosable
- Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- Efficient generation of different topological representations of graphs beyond-planarity
- IC-planar graphs are odd-10-colorable
- The linear 2-arboricity of IC-planar graphs
- On optimal beyond-planar graphs
- The surviving rate of NIC-planar graphs
- Colorings, cliques and relaxations of planarity
- Cyclic colorings of plane graphs with independent faces
- Extending partial 1-planar drawings
- An identifying operation on a 1-planar graph with an application to acyclic coloring
- Crossing numbers of beyond planar graphs re-revisited: a framework approach
- Acyclic choosability of IC-planar graphs
- Acyclic chromatic index of IC-planar graphs
- OOPS: optimized one-planarity solver via SAT
- OOPS: optimized one-planarity solver via SAT
This page was built for publication: Chromatic number, independence ratio, and crossing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535837)
