Works matching IS 03649024 AND DT 2025 AND VI 108 AND IP 4

Results: 12

On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 817, doi. 10.1002/jgt.23207

By:

Bradač, Domagoj

Publication type:

Article

Small Planar Hypohamiltonian Graphs.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 799, doi. 10.1002/jgt.23205

By:

Tsai, Cheng‐Chen

Publication type:

Article

Hypergraph Anti‐Ramsey Theorems.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 808, doi. 10.1002/jgt.23204

By:

Liu, Xizhi;
Song, Jialei

Publication type:

Article

Equitable List Coloring of Planar Graphs With Given Maximum Degree.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 832, doi. 10.1002/jgt.23203

By:

Kierstead, H. A.;
Kostochka, Alexandr;
Xiang, Zimu

Publication type:

Article

On the Pre‐ and Post‐Positional Semi‐Random Graph Processes.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 819, doi. 10.1002/jgt.23202

By:

Gao, Pu;
Koerts, Hidde

Publication type:

Article

Tight Upper Bound on the Clique Size in the Square of 2‐Degenerate Graphs.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 781, doi. 10.1002/jgt.23201

By:

Kim, Seog‐Jin;
Lian, Xiaopan

Publication type:

Article

Odd chromatic number of graph classes.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 722, doi. 10.1002/jgt.23200

By:

Belmonte, Rémy;
Harutyunyan, Ararat;
Köhler, Noleen;
Melissinos, Nikolaos

Publication type:

Article

Edge‐arc‐disjoint paths in semicomplete mixed graphs.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 705, doi. 10.1002/jgt.23199

By:

Bang‐Jensen, J.;
Wang, Y.

Publication type:

Article

The maximum number of odd cycles in a planar graph.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 745, doi. 10.1002/jgt.23197

By:

Heath, Emily;
Martin, Ryan R.;
Wells, Chris

Publication type:

Article

The effect of symmetry‐preserving operations on 3‐connectivity.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 672, doi. 10.1002/jgt.23196

By:

Van den Camp, Heidi

Publication type:

Article

Graphs with girth 2ℓ+1 and without longer odd holes are 3‐colorable.

Published in:

Journal of Graph Theory, 2025, v. 108, n. 4, p. 661, doi. 10.1002/jgt.23195

By:

Chen, Rong

Publication type:

Article

Issue Information.

Published in:: Journal of Graph Theory, 2025, v. 108, n. 4, p. 657, doi. 10.1002/jgt.23133
Publication type:: Article