Pages that link to "Item:Q907266"
From MaRDI portal
The following pages link to The chromatic number of a signed graph (Q907266):
Displaying 49 items.
- Coloring signed graphs using DFS (Q276341) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- Colouring of generalized signed triangle-free planar graphs (Q1712532) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Eigenvalues and chromatic number of a signed graph (Q2020660) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- The chromatic number of joins of signed graphs (Q2053734) (← links)
- The circular chromatic numbers of signed series-parallel graphs (Q2065905) (← links)
- Density of \(C_{-4}\)-critical signed graphs (Q2072181) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Complex and homomorphic chromatic number of signed planar simple graphs (Q2117521) (← links)
- Edge coloring of the signed generalized Petersen graph (Q2117562) (← links)
- Generalized signed graphs of large girth and large chromatic number (Q2144578) (← links)
- A categorification for the signed chromatic polynomial (Q2152787) (← links)
- Signed planar graphs with given circular chromatic numbers (Q2166279) (← links)
- A generalization of Noel-Reed-Wu theorem to signed graphs (Q2174577) (← links)
- Edge coloring of signed graphs (Q2185748) (← links)
- \(4\)-colouring of generalized signed planar graphs (Q2194082) (← links)
- Tutte's dichromate for signed graphs (Q2217470) (← links)
- On the 4-color theorem for signed graphs (Q2225420) (← links)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Colouring of \(S\)-labelled planar graphs (Q2225437) (← links)
- Edge coloring signed graphs (Q2279977) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- Chromatic number and orientations of graphs and signed graphs (Q2316537) (← links)
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs (Q2334069) (← links)
- Hajós-like theorem for signed graphs (Q2408976) (← links)
- The chromatic spectrum of signed graphs (Q2629274) (← links)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q2672623) (← links)
- Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications (Q2686135) (← links)
- Coloring permutation-gain graphs (Q4986271) (← links)
- Coloring problem of signed interval graphs (Q4997206) (← links)
- (Q5047016) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- Not all planar graphs are in PURE-4-DIR (Q5119380) (← links)
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable (Q6041542) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- On colorings and orientations of signed graphs (Q6063839) (← links)
- The circular chromatic number of signed series-parallel graphs of given girth (Q6069153) (← links)
- Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem (Q6080558) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
- Separating signatures in signed planar graphs (Q6110620) (← links)
- Symmetric set coloring of signed graphs (Q6114964) (← links)
- The list-coloring function of signed graphs (Q6136674) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
- Homomorphisms to small negative even cycles (Q6201924) (← links)
