Pages that link to "Item:Q497343"

The following pages link to The backbone coloring problem for bipartite backbones (Q497343):

Displaying 11 items.

• Backbone coloring for graphs with large girths (Q385734) (← links)
• The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637) (← links)
• Backbone colorings of graphs with bounded degree (Q968172) (← links)
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
• Optimal backbone coloring of split graphs with matching backbones (Q2259577) (← links)
• The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776) (← links)
• Backbone colourings of graphs (Q2629282) (← links)
• Backbone colorings for graphs: Tree and path backbones (Q3445508) (← links)
• A theoretical analysis of backtracking in the graph coloring problem (Q3736910) (← links)
• Steinberg-like theorems for backbone colouring (Q5890934) (← links)
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)