Pages that link to "Item:Q1356483"
From MaRDI portal
The following pages link to Defining sets in vertex colorings of graphs and latin rectangles (Q1356483):
Displaying 19 items.
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- Note on property \(M(k)\) of some complete multipartite graphs (Q477636) (← links)
- Extremal anti-forcing numbers of perfect matchings of graphs (Q526817) (← links)
- Silver cubes (Q1014825) (← links)
- Defining numbers in some of the Harary graphs (Q1023081) (← links)
- On defining numbers of vertex colouring of regular graphs (Q1292860) (← links)
- A characterization of uniquely vertex colorable graphs using minimal defining sets (Q1297453) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- On the forced matching numbers of bipartite graphs (Q1827691) (← links)
- Complete forcing numbers of hexagonal systems (Q2046284) (← links)
- Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
- The restrained geodetic number of a graph (Q2350702) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- Generalized Latin squares and their defining sets (Q2427495) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- Greedy defining sets in graphs and Latin squares (Q3439453) (← links)
- Determination of the size of defining set for Steiner triple systems (Q5059557) (← links)
- On the extending of<i>k</i>-regular graphs and their strong defining spectrum (Q5473095) (← links)
- Complete forcing numbers of complete and almost-complete multipartite graphs (Q6053962) (← links)
