The absence of monochromatic triangle implies various properly colored spanning trees
Fuente:
arXiv
Saved in:
| Main Authors: | Li, Ruonan, Lu, Ruhui, Su, Xueli, Zhang, Shenggui |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Path-monochromatic bounded depth rooted trees in (random) tournaments
by: Yuster, Raphael
Published: (2024)
by: Yuster, Raphael
Published: (2024)
Distinguishing symmetric digraphs by proper arc-colourings of type I
by: Kalinowski, Rafał, et al.
Published: (2025)
by: Kalinowski, Rafał, et al.
Published: (2025)
Existence of trees with prescribed maximum degrees and spectral radii
by: Dong, Fengming, et al.
Published: (2025)
by: Dong, Fengming, et al.
Published: (2025)
Walecki tournaments with an arc that lies in a unique directed triangle
by: Morris, Joy
Published: (2024)
by: Morris, Joy
Published: (2024)
A new characterization of the set of Laplacian spectral radii of trees
by: Dong, Fengming, et al.
Published: (2026)
by: Dong, Fengming, et al.
Published: (2026)
Antidirected trees in dense digraphs
by: Stein, Maya, et al.
Published: (2024)
by: Stein, Maya, et al.
Published: (2024)
Odd spanning trees of a graph
by: Zheng, Jingyu, et al.
Published: (2025)
by: Zheng, Jingyu, et al.
Published: (2025)
Density of rainbow triangles and properly colored $K_4$'s
by: Balogh, József, et al.
Published: (2025)
by: Balogh, József, et al.
Published: (2025)
Representing distance-hereditary graphs with multi-rooted trees
by: Scholz, Guillaume E.
Published: (2025)
by: Scholz, Guillaume E.
Published: (2025)
The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
by: Ge, Jun, et al.
Published: (2026)
by: Ge, Jun, et al.
Published: (2026)
Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
by: Olsen, Mika, et al.
Published: (2025)
by: Olsen, Mika, et al.
Published: (2025)
A result on spanning trees with bounded total excess
by: Zhou, Sizhong
Published: (2025)
by: Zhou, Sizhong
Published: (2025)
Antidirected trees in directed graphs
by: Kontogeorgiou, George, et al.
Published: (2025)
by: Kontogeorgiou, George, et al.
Published: (2025)
Vertex-partitions of 2-edge-colored graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)
by: Wu, Jiancheng, et al.
Published: (2024)
The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)
by: Grašič, Mateja, et al.
Published: (2024)
On the 3-colorability of triangle-free and fork-free graphs
by: Schroeder, Joshua, et al.
Published: (2021)
by: Schroeder, Joshua, et al.
Published: (2021)
Eigenvalues and spanning trees with constrained degree
by: Liu, Chang, et al.
Published: (2023)
by: Liu, Chang, et al.
Published: (2023)
Normal trees of digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices
by: Li, Yibo, et al.
Published: (2024)
by: Li, Yibo, et al.
Published: (2024)
A new strategy for finding spanning trees without small degree stems
by: Furuya, Michitaka, et al.
Published: (2023)
by: Furuya, Michitaka, et al.
Published: (2023)
Openly disjoint cycles and directed tree-width of regular digraphs
by: Steiner, Raphael
Published: (2026)
by: Steiner, Raphael
Published: (2026)
Refinements of degree conditions for the existence of a spanning tree without small degree stems
by: Furuya, Michitaka, et al.
Published: (2023)
by: Furuya, Michitaka, et al.
Published: (2023)
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)
by: Xu, Shaohan, et al.
Published: (2025)
Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)
by: Gao, Yongbin, et al.
Published: (2026)
Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)
by: Lin, Jifu, et al.
Published: (2024)
A method to optimize antipodal coloring span of graphs and its application
by: Kumar, Kush, et al.
Published: (2025)
by: Kumar, Kush, et al.
Published: (2025)
Kernels in digraphs with colored vertices
by: Guevara, Mucuy-kak, et al.
Published: (2025)
by: Guevara, Mucuy-kak, et al.
Published: (2025)
On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)
by: Wang, Wei, et al.
Published: (2026)
Turán-type and tiling problems in oriented graphs
by: Chen, Ming, et al.
Published: (2026)
by: Chen, Ming, et al.
Published: (2026)
A neighborhood union condition for the existence of a spanning tree without samll degree vertices
by: Li, Yibo, et al.
Published: (2025)
by: Li, Yibo, et al.
Published: (2025)
Long paths need not minimize $H$-colorings among trees
by: Galvin, David, et al.
Published: (2025)
by: Galvin, David, et al.
Published: (2025)
Inversion diameter and 2-edge-colored homomorphisms
by: Arana, Carmen, et al.
Published: (2026)
by: Arana, Carmen, et al.
Published: (2026)
Effective resistance and spanning trees in complete graphs with distance-class deletions
by: Tamura, Shunya
Published: (2026)
by: Tamura, Shunya
Published: (2026)
Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations
by: Bishop, Jamie, et al.
Published: (2022)
by: Bishop, Jamie, et al.
Published: (2022)
The half-monochromatic colorings of plane graphs with even polygonal faces
by: Ichihara, Kazuhiro, et al.
Published: (2026)
by: Ichihara, Kazuhiro, et al.
Published: (2026)
Oriented trees in digraphs with large girth
by: Lu, Junying, et al.
Published: (2025)
by: Lu, Junying, et al.
Published: (2025)
Chain--collider--fork Decompositions of Transitive Tournament
by: Gunasekara, Ajani De Vas
Published: (2026)
by: Gunasekara, Ajani De Vas
Published: (2026)
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
Spectral radius and homeomorphically irreducible spanning trees of graphs
by: Gao, Bingqian, et al.
Published: (2025)
by: Gao, Bingqian, et al.
Published: (2025)
Similar Items
-
Path-monochromatic bounded depth rooted trees in (random) tournaments
by: Yuster, Raphael
Published: (2024) -
Distinguishing symmetric digraphs by proper arc-colourings of type I
by: Kalinowski, Rafał, et al.
Published: (2025) -
Existence of trees with prescribed maximum degrees and spectral radii
by: Dong, Fengming, et al.
Published: (2025) -
Walecki tournaments with an arc that lies in a unique directed triangle
by: Morris, Joy
Published: (2024) -
A new characterization of the set of Laplacian spectral radii of trees
by: Dong, Fengming, et al.
Published: (2026)