Pages that link to "Item:Q3445508"
From MaRDI portal
The following pages link to Backbone colorings for graphs: Tree and path backbones (Q3445508):
Displaying 11 items.
- Backbone coloring for graphs with large girths (Q385734) (← links)
- Backbone colouring: tree backbones with small diameter in planar graphs (Q387001) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637) (← links)
- The backbone coloring problem for bipartite backbones (Q497343) (← links)
- Backbone coloring of planar graphs without special circles (Q650874) (← links)
- Backbone colorings of graphs with bounded degree (Q968172) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Circular backbone colorings: on matching and tree backbones of planar graphs (Q1627845) (← links)
- Steinberg-like theorems for backbone colouring (Q5890934) (← links)
- Steinberg-like theorems for backbone colouring (Q5916058) (← links)
