Difference Sets Disjoint from a Subgroup IV: The Skew Relative Cases with Added Symmetry.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02917-6
- By:
- Publication type:
- Article
Works matching IS 09110119 AND DT 2025 AND VI 41 AND IP 3
Results: 18
1
2
Large Induced Distance Matchings in Certain Sparse Random Graphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02921-w
- By:
- Publication type:
- Article
3
Irregularity Notions for Digraphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02927-4
- By:
- Publication type:
- Article
4
On the Existence of (r,g,χ)-Cages.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02915-8
- By:
- Publication type:
- Article
5
Compatible Forts and Maximum Nullity of a Graph.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02919-4
- By:
- Publication type:
- Article
6
Upper Bounds for the List-Distinguishing Chromatic Number.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02920-x
- By:
- Publication type:
- Article
7
Upper Bounds for the List-Distinguishing Chromatic Number.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02920-x
- By:
- Publication type:
- Article
8
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02923-8
- By:
- Publication type:
- Article
9
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02923-8
- By:
- Publication type:
- Article
10
Odd-Even Factors of Graphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02918-5
- By:
- Publication type:
- Article
11
On Hamilton Paths in Vertex-Transitive Graphs of Order 10p.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02924-7
- By:
- Publication type:
- Article
12
On the structure of some classes of (P2∪P3)-free graphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02926-5
- By:
- Publication type:
- Article
13
A New Polynomial for Checkerboard-Colorable 4-Valent Virtual Graphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02928-3
- By:
- Publication type:
- Article
14
On Flipping Edge Sets in Unique Sink Orientations.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02929-2
- By:
- Publication type:
- Article
15
Set Systems with Covering Properties and Low VC-Dimension.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02922-9
- By:
- Publication type:
- Article
16
Periodic Orbits on 2-Regular Circulant Digraphs.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02931-8
- By:
- Publication type:
- Article
17
Recognizing Relating Edges in Graphs Without Cycles of Length 6.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02930-9
- By:
- Publication type:
- Article
18
On Dirac and Motzkin Problem in Discrete Geometry.
- Published in:
- Graphs & Combinatorics, 2025, v. 41, n. 3, p. 1, doi. 10.1007/s00373-025-02913-w
- By:
- Publication type:
- Article