Pages that link to "Item:Q2381540"

The following pages link to On the \(b\)-continuity property of graphs (Q2381540):

Displaying 28 items.

• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs (Q339486) (← links)
• Bounds for the \(b\)-chromatic number of \(G-v\) (Q385136) (← links)
• On the \(b\)-chromatic number of regular graphs without 4-cycle (Q427905) (← links)
• Graphs with large girth are \(b\)-continuous (Q510951) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• The b-chromatic number of cubic graphs (Q604658) (← links)
• The \(b\)-chromatic index of a graph (Q745926) (← links)
• On the b-chromatic number of Kneser graphs (Q968135) (← links)
• On \(b\)-coloring of the Kneser graphs (Q1043965) (← 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)
• A characterization of edge \(b\)-critical graphs (Q1701125) (← 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)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
• The \(b\)-chromatic index of graphs (Q2352073) (← links)
• The \(b\)-chromatic index of direct product of graphs (Q2352788) (← links)
• On the \(b\)-continuity property of graphs (Q2381540) (← links)
• The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity (Q2413181) (← links)
• An integer programming approach to b-coloring (Q2419584) (← links)
• \(b\)-chromatic numbers of powers of paths and cycles (Q2444545) (← links)
• About the b-continuity of graphs (Q3439146) (← links)
• A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
• Upper and lower bounds based on linear programming for the b-coloring problem (Q6114961) (← links)