Pages that link to "Item:Q968172"

The following pages link to Backbone colorings of graphs with bounded degree (Q968172):

Displaying 15 items.

• Backbone coloring for graphs with large girths (Q385734) (← links)
• On backbone coloring of graphs (Q434190) (← links)
• The backbone coloring problem for bipartite backbones (Q497343) (← 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 coloring of planar graphs for \(C_8\)-free or \(C_9\)-free (Q2344770) (← links)
• Backbone coloring for triangle-free planar graphs (Q2401793) (← links)
• List backbone colouring of graphs (Q2440098) (← links)
• Backbone colourings of graphs (Q2629282) (← links)
• Backbone colorings for graphs: Tree and path backbones (Q3445508) (← links)
• (Q4926710) (← links)
• Steinberg-like theorems for backbone colouring (Q5890934) (← links)
• Backbone coloring of graphs with galaxy backbones (Q5918549) (← links)
• Backbone coloring of graphs with galaxy backbones (Q5918665) (← links)
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)