Pages that link to "Item:Q2352073"
From MaRDI portal
The following pages link to The \(b\)-chromatic index of graphs (Q2352073):
Displaying 11 items.
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
- Graphs with large girth are \(b\)-continuous (Q510951) (← links)
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
- The \(b\)-continuity of graphs with large girth (Q1684929) (← links)
- On the \(b\)-continuity of the lexicographic product of graphs (Q1684933) (← links)
- Edge-\(b\)-coloring trees (Q1702122) (← links)
- Graphs with small fall-spectrum (Q1720325) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- New bounds for the \(b\)-chromatic number of vertex deleted graphs (Q2243141) (← links)
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity (Q2413181) (← links)
- Upper and lower bounds based on linear programming for the b-coloring problem (Q6114961) (← links)