Pages that link to "Item:Q1318798"
From MaRDI portal
The following pages link to The total chromatic number of regular graphs whose complement is bipartite (Q1318798):
Displaying 15 items.
- The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940) (← links)
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- The total chromatic number of complete multipartite graphs with low deficiency (Q897273) (← links)
- The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- Total colouring regular bipartite graphs is NP-hard (Q1313834) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- Regular Turán numbers of complete bipartite graphs (Q2043399) (← links)
- On total coloring the direct product of cycles and bipartite direct product of graphs (Q2699911) (← links)
- The Total Thurston–Bennequin Number of Complete and Complete Bipartite Legendrian Graphs (Q2833031) (← links)
- (Q3984519) (← links)
- A sufficient condition for bipartite graphs to be type one (Q4242957) (← links)
- Coloring graphs which have equibipartite complements (Q4376493) (← links)
- Total chromatic number of honeycomb network (Q5034972) (← links)
