A note on the immersion number of generalized Mycielski graphs
From MaRDI portal
Publication:6616828
DOI10.1007/978-3-031-52969-6_21zbMATH Open1548.05242MaRDI QIDQ6616828
Megan E. Heenehan, Jessica McDonald, Karen L. Collins
Publication date: 9 October 2024
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- On constructive methods in the theory of colour-critical graphs
- 4-chromatic graphs with large odd girth
- On clique immersions in line graphs
- Generalised Mycielski graphs and the Borsuk-Ulam theorem
- Fractional chromatic numbers of cones over graphs
- Graph Coloring and the Immersion Order
- On Representatives of Subsets
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
- Sur le coloriage des graphs
- Clique immersion in graph products
- On an estimate of the chromatic class of a \(p\)-graph
This page was built for publication: A note on the immersion number of generalized Mycielski graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616828)
