Pages that link to "Item:Q3159395"

The following pages link to Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs (Q3159395):

Displaying 27 items.

• The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class (Q279204) (← links)
• A comparison of integer and constraint programming models for the deficiency problem (Q342299) (← links)
• Forbidden structures for planar perfect consecutively colourable graphs (Q521749) (← links)
• Interval incidence coloring of subcubic graphs (Q521761) (← links)
• Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs (Q548414) (← links)
• On resistance of graphs (Q643030) (← links)
• A note on path factors of (3,4)-biregular bipartite graphs (Q648412) (← links)
• On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
• Lower bounds and a tabu search algorithm for the minimum deficiency problem (Q841600) (← links)
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs (Q882116) (← links)
• On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
• Interval edge-colorings of complete graphs and \(n\)-dimensional cubes (Q968437) (← links)
• On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
• Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs (Q1690222) (← links)
• Some remarks on interval colorings of complete tripartite and biregular graphs (Q2306598) (← links)
• On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs (Q2401803) (← links)
• One-sided interval edge-colorings of bipartite graphs (Q2629271) (← links)
• Interval incidence coloring of bipartite graphs (Q2636801) (← links)
• A note on one-sided interval edge colorings of bipartite graphs (Q2666587) (← links)
• On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees (Q2947944) (← links)
• Symmetry Breaking Constraints for the Minimum Deficiency Problem (Q2971392) (← links)
• Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs (Q3632998) (← links)
• (Q5150426) (← links)
• Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs (Q5495881) (← links)
• Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)
• Interval colorings of graphs—Coordinated and unstable no‐wait schedules (Q6084715) (← links)
• Interval colourable orientations of graphs (Q6589119) (← links)