Found: 5
Select item for more details and to access through your institution.
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.
- Published in:
- Graphs & Combinatorics, 2023, v. 39, n. 3, p. 1, doi. 10.1007/s00373-023-02637-9
- By:
- Publication type:
- Article
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.
- Published in:
- Graphs & Combinatorics, 2023, v. 39, n. 3, p. 1, doi. 10.1007/s00373-023-02637-9
- By:
- Publication type:
- Article
Trees with Given Stability Number and Minimum Number of Stable Sets.
- Published in:
- Graphs & Combinatorics, 2012, v. 28, n. 2, p. 167, doi. 10.1007/s00373-011-1041-2
- By:
- Publication type:
- Article
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships.
- Published in:
- Networks, 2008, v. 52, n. 4, p. 287, doi. 10.1002/net.20250
- By:
- Publication type:
- Article
MINIMUM ECCENTRIC CONNECTIVITY INDEX FOR GRAPHS WITH FIXED ORDER AND FIXED NUMBER OF PENDANT VERTICES.
- Published in:
- Yugoslav Journal of Operations Research, 2019, v. 29, n. 2, p. 193, doi. 10.2298/YJOR181115010D
- By:
- Publication type:
- Article