On the path separation number of graphs (original) (raw)
Related papers
C O ] 2 J un 2 01 6 On the path separation number of graphs
2017
On the separation number of a graph
Networks, 1989
Independence Number in Path Graphs
Computing and Informatics / Computers and Artificial Intelligence - CAI, 2004
Separating path systems in trees
arXiv (Cornell University), 2023
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing, 1998
On the Number of Minimal Separators in Graphs
Lecture Notes in Computer Science, 2016
Non-separating subgraphs after deleting many disjoint paths
2011
Increasing paths in edge-ordered graphs: the hypercube and random graphs
arXiv (Cornell University), 2015
Path Decomposition Number of Certain Graphs
Open Journal of Discrete Applied Mathematics, 2018
Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph
Electronic Journal of Combinatorics, 2016
Edge decompositions of hypercubes by paths
2015
Decomposition of Graphs into Paths
Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC), 2017
The RED-BLUE SEPARATION problem on graphs
Theoretical Computer Science
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
SIAM Journal on Computing, 1994
A 1-separation formula for the graph Kemeny constant and Braess edges
Journal of Mathematical Chemistry, 2021
Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
Acta Mathematica Sinica, English Series, 2012
The Locating-Chromatic Number of Disconnected Graphs
2014
Double independent subsets of a graph
1989
Splitting a graph into disjoint induced paths or cycles
2003
Connection and separation in hypergraphs
Theory and Applications of Graphs, 2015
The induced path number of the complements of some graphs
New bounds on the independence number of connected graphs
Discrete Mathematics, Algorithms and Applications, 2018
The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
arXiv (Cornell University), 2019
On the independence number of a graph in terms of order and size
Discrete Mathematics, 2001
Disjoint paths on expander graphs
Combinatorica, 1989
Path separation by short cycles
Disjoint path covers with path length constraints in restricted hypercube-like graphs
Journal of Computer and System Sciences, 2017
Mathematics And its Applications The Split ( Nonsplit ) Nomatic Number of a Graph Research
On the k-independence number of graphs
Discrete Mathematics, 2019
On paths, trails and closed trails in edge-colored graphs
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
A complete characterisation of the linear clique-width of path powers
2009