Pages that link to "Item:Q3568713"
From MaRDI portal
The following pages link to Lower bounds for the colored mixed chromatic number of some classes of graphs. (Q3568713):
Displaying 14 items.
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- Colored homomorphisms of colored mixed graphs (Q1850491) (← links)
- On clique numbers of colored mixed graphs (Q2097162) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- Chromatic number of sparse colored mixed planar graphs (Q2851490) (← links)
- (Q3300693) (← links)
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs (Q5272645) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5900082) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5901070) (← links)
- Smaller universal targets for homomorphisms of edge-colored graphs (Q5918745) (← links)
- On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters (Q6611087) (← links)
- On coloring parameters of triangle-free planar \((n, m)\)-graphs (Q6640959) (← links)