Pages that link to "Item:Q1026139"
From MaRDI portal
The following pages link to On \(b\)-colorings in regular graphs (Q1026139):
Displayed 21 items.
- The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940) (← links)
- On the \(b\)-chromatic number of regular graphs without 4-cycle (Q427905) (← links)
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← links)
- Recolouring-resistant colourings (Q548277) (← links)
- The b-chromatic number of cubic graphs (Q604658) (← links)
- \(b\)-coloring of Kneser graphs (Q765331) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
- The \(b\)-continuity of graphs with large girth (Q1684929) (← links)
- Edge-\(b\)-coloring trees (Q1702122) (← links)
- A note on approximating the \(b\)-chromatic number (Q1949121) (← links)
- Graphs with girth at least 8 are b-continuous (Q2132404) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
- Graphs of girth at least 7 have high \(b\)-chromatic number (Q2346588) (← links)
- On the \(b\)-chromatic number of regular bounded graphs (Q2355753) (← links)
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement (Q2434725) (← links)
- \(b\)-chromatic numbers of powers of paths and cycles (Q2444545) (← links)
- On b-vertex and b-edge critical graphs (Q3459012) (← links)
- (Q5071864) (← links)
- Some results on the <i>b</i>-chromatic number in complementary prism graphs (Q5244296) (← links)