Pages that link to "Item:Q1916388"
From MaRDI portal
The following pages link to On equitable coloring of bipartite graphs (Q1916388):
Displaying 50 items.
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- Equitable and list equitable colorings of planar graphs without 4-cycles (Q389204) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- Equitable \(\Delta\)-coloring of graphs (Q411652) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- On equitable and equitable list colorings of series-parallel graphs (Q534037) (← links)
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths (Q539352) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Equitable and equitable list colorings of graphs (Q604470) (← links)
- On equitable colorings of sparse graphs (Q726517) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- Equitable colorings of planar graphs with maximum degree at least nine (Q764891) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- Equitable list colorings of planar graphs without short cycles (Q954980) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Equitable coloring of three classes of 1-planar graphs (Q1753367) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Equitable coloring of some convex polytope graphs (Q1794705) (← links)
- Equitable colorings of planar graphs without short cycles (Q1929237) (← links)
- A note on the equitable choosability of complete bipartite graphs (Q2042622) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- On the equitable choosability of the disjoint union of stars (Q2084783) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\) (Q2454985) (← links)
- An Ore-type theorem on equitable coloring (Q2464162) (← links)
- Equitable coloring planar graphs with large girth (Q2470470) (← links)
- On Equitable Coloring of Central Graphs and Total Graphs (Q2839223) (← links)
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051) (← links)
- On equitable colouring of Knödel graphs (Q2935368) (← links)
- EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS (Q3575377) (← links)
- Equitable coloring parameters of certain graph classes (Q4554571) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- On equitable coloring of corona of wheels (Q5006590) (← links)
- Equitable chromatic number of weak modular product of Some graphs (Q5039443) (← links)
- Equitable list vertex colourability and arboricity of grids (Q5086846) (← links)
- On certain parameters of equitable coloring of graphs (Q5370829) (← links)
- On the equitable chromatic number of complete \(n\)-partite graphs (Q5951975) (← links)
- Equitable oriented coloring (Q6047973) (← links)
- Equitable critical graphs (Q6059092) (← links)
- Extremal numbers for disjoint copies of a clique (Q6202950) (← links)
