Pages that link to "Item:Q3439400"
From MaRDI portal
The following pages link to The total chromatic number of some bipartite graphs (Q3439400):
Displaying 12 items.
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- The total chromatic number of complete multipartite graphs with low deficiency (Q897273) (← links)
- A study of the total chromatic number of equibipartite graphs (Q1584229) (← links)
- Total colorings of product graphs (Q1743686) (← links)
- 2-edge-colored chromatic number of grids is at most 9 (Q2175809) (← links)
- Total coloring conjecture for certain classes of graphs (Q2283827) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- (Q4697576) (← links)
- On the Total Set Chromatic Number of Graphs (Q5044524) (← links)
- The distinguishing chromatic number of bipartite graphs of girth at least six (Q5122711) (← links)
- (Q5360943) (← links)
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice (Q5936032) (← links)