Works matching IS 09110119 AND DT 2025 AND VI 41 AND IP 2
Results: 11
A Note on Sullivan’s Second Neighborhood Conjecture.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02908-7
- By:
- Publication type:
- Article
Regular Hypermaps with the Automorphism Group PSL(3,p)
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02906-9
- By:
- Publication type:
- Article
Intersection Numbers of Certain 2-Designs from Finite Fields.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02905-w
- By:
- Publication type:
- Article
Two Variants of Toughness of a Graph and its Eigenvalues.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02903-y
- By:
- Publication type:
- Article
A Note on the Facial Edge-Coloring Conjecture.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02904-x
- By:
- Publication type:
- Article
Towards Optimal χ-Binding Functions of (2K1∪K2)-Free Graphs and (P3∪K1)-Free Graphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02897-7
- By:
- Publication type:
- Article
Isoperimetric Formulas for Hyperbolic Animals.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02900-1
- By:
- Publication type:
- Article
The Structure of Minimally 1-Tough Graphs with Small Independence Number.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02902-z
- By:
- Publication type:
- Article
Improved Bound for Hadwiger’s Conjecture.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-025-02899-5
- By:
- Publication type:
- Article
Between Weak and Bruhat: The Middle Order on Permutations.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-024-02885-3
- By:
- Publication type:
- Article
2-Reducible Two Paths and Two Edges Constructing a Cycle in (2k+1)-Edge-Connected Graphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 2, p. 1, doi. 10.1007/s00373-024-02873-7
- By:
- Publication type:
- Article