Disjoint non-balanced A-paths in biased graphs (original) (raw)
Related papers
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing, 1998
General-demand disjoint path covers in a graph with faulty elements
International Journal of Computer Mathematics, 2012
Operations Research Letters, 2007
Ore-type degree conditions for disjoint path covers in simple graphs
Discrete Mathematics, 2016
Hardness of the undirected edge-disjoint paths problem
2005
A disjoint path problem in the alternating group graph
Graph partition into paths containing specified vertices
Discrete Mathematics, 2002
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Combinatorica, 2014
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory, Series B, 1985
The induced path number of the complements of some graphs
Disjoint paths of bounded length in large generalized cycles.
3-PATH in Graphs with Bounded Average Degree
Discussiones Mathematicae Graph Theory, 2015
On paths, trails and closed trails in edge-colored graphs
Vertex Disjoint Paths in Upward Planar Graphs
Lecture Notes in Computer Science, 2014
A path(ological) partition problem
Discussiones Mathematicae Graph Theory, 1998
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
SIAM Journal on Computing, 1994
Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
Acta Mathematica Sinica, English Series, 2012
ACM Transactions on Algorithms, 2007
Non-separating subgraphs after deleting many disjoint paths
2011
Balanced Paths in Colored Graphs
Mathematical Foundations of Computer Science 2009, 2009
Disjoint path covers with path length constraints in restricted hypercube-like graphs
Journal of Computer and System Sciences, 2017
A characterization of graphs without long induced paths
Journal of Graph Theory, 1990
A survey of the Path Partition Conjecture
Discussiones Mathematicae Graph Theory, 2013
Antimagic Labeling for Unions of Graphs with Many Three-Paths
Cornell University - arXiv, 2022
Independent cycles and paths in bipartite balanced graphs
Discussiones Mathematicae Graph Theory, 2008
The Goodness of Long Path with Respect to Multiple Copies of Complete Graphs
Journal of the Indonesian Mathematical Society, 2014
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
Decomposition of Graphs into Paths
Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC), 2017
Path partitions and packs of acyclic digraphs
Pacific Journal of Mathematics, 1985
Equitable Bipartitions of Graphs and Related Results
Journal of Mathematical Sciences, 2004
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs
The Journal of Supercomputing
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM, 1978
Ore-type degree conditions, Path-Systems and Linkages in Graphs
2003
On path decompositions of 2k-regular graphs
Electronic Notes in Discrete Mathematics, 2015
On the Ramsey numbers for paths and generalized Jahangir graphs
arXiv (Cornell University), 2008