Unbalanced spanning subgraphs in edge labeled complete graphs
From MaRDI portal
Publication:2692172
DOI10.37236/10866OpenAlexW3183237568MaRDI QIDQ2692172
Dieter Rautenbach, L. Picasarri-Arrieta, Johannes Pardey, Stéphane Bessy
Publication date: 21 March 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09290
Trees (05C05) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Zero-sum problems in finite Abelian groups: a survey
- Unavoidable subgraphs of colored graphs
- Unavoidable patterns
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Heavy paths and cycles in weighted graphs
- Zero-sum problems -- a survey
- On zero-sum spanning trees and zero-sum connectivity
- Zero-sum copies of spanning forests in zero-sum complete graphs
- On the discrepancies of graphs
- Low weight perfect matchings
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation
- On maximal paths and circuits of graphs
- A Note on Color-Bias Hamilton Cycles in Dense Graphs
- A discrepancy version of the Hajnal–Szemerédi theorem
- On the existence of zero-sum perfect matchings of complete graphs
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
This page was built for publication: Unbalanced spanning subgraphs in edge labeled complete graphs
