Pages that link to "Item:Q2676763"
From MaRDI portal
The following pages link to An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 (Q2676763):
Displaying 5 items.
- Maximum chromatic polynomial of 3-chromatic blocks (Q1366786) (← links)
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 (Q2488941) (← links)
- (Q4322680) (← links)
- The \(t\)-tone chromatic number of classes of sparse graphs (Q6134964) (← links)
- 2-tone coloring of cactus graphs (Q6202945) (← links)