Works matching IS 03649024 AND DT 2023 AND VI 104 AND IP 1

Results: 12

Nonabelian flows in networks.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 245, doi. 10.1002/jgt.22958

By:

van Gent, D. M. H.

Publication type:

Article

C5 ${C}_{5}$ is almost a fractalizer.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 220, doi. 10.1002/jgt.22957

By:

Lidický, Bernard;
Mattes, Connor;
Pfender, Florian

Publication type:

Article

Adaptable and conflict colouring multigraphs with no cycles of length three or four.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 188, doi. 10.1002/jgt.22956

By:

Aliaj, Jurgen;
Molloy, Michael

Publication type:

Article

Equitable oriented coloring.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 171, doi. 10.1002/jgt.22955

By:

Dybizbański, Janusz

Publication type:

Article

Issue Information.

Published in:: Journal of Graph Theory, 2023, v. 104, n. 1, p. 1, doi. 10.1002/jgt.23010
Publication type:: Article

Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 160, doi. 10.1002/jgt.22954

By:

Li, Danyi;
Chen, Wuxian;
Yan, Weigen

Publication type:

Article

On deeply critical oriented cliques.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 150, doi. 10.1002/jgt.22953

By:

Duffy, Christopher;
Pavan, P. D.;
Sandeep, R. B.;
Sen, Sagnik

Publication type:

Article

Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 104, doi. 10.1002/jgt.22951

By:

Falgas‐Ravry, Victor;
Hancock, Robert;
Strömberg, Johanna;
Uzzell, Andrew

Publication type:

Article

ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 133, doi. 10.1002/jgt.22952

By:

Zhang, Meiqiao;
Dong, Fengming

Publication type:

Article

Spanners in randomly weighted graphs: Euclidean case.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 87, doi. 10.1002/jgt.22950

By:

Frieze, Alan;
Pegden, Wesley

Publication type:

Article

Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 17, doi. 10.1002/jgt.22949

By:

Bonamy, Marthe;
Pierron, Théo;
Sopena, Éric

Publication type:

Article

MaxCut on permutation graphs is NP‐complete.

Published in:

Journal of Graph Theory, 2023, v. 104, n. 1, p. 5, doi. 10.1002/jgt.22948

By:

de Figueiredo, Celina M. H.;
de Melo, Alexsander A.;
Oliveira, Fabiano S.;
Silva, Ana

Publication type:

Article