Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/the-induced-separation-dimension-of-a-graph-0NDQ98FLI9
References (22)
-
F Gavril (2000)
Maximum weight independent sets and cliques in intersection graphs of filamentsInf. Process. Lett., 73
-
VV Lozin, M Kaminski (2007)
Coloring edges and vertices of graphs without short or long cyclesContrib. Discrete Math., 2
-
N Eaton, G Faubert (2012)
Caterpillar tolerance representationsBull. Inst. Comb. Appl., 64
-
MC Golumbic, AN Trenk (2004)
Tolerance Graphs -
K Cameron (2004)
Induced matchings in intersection graphsDiscrete Math., 278
-
K Cameron (1989)
Induced matchingsDiscrete Appl. Math., 24
-
VV Lozin, R Mosca (2005)
Independent sets in extensions of $$2K_2$$ 2 K 2 -free graphsDiscrete Appl. Math., 146
-
K Cameron, R Sritharan, Y Tang (2003)
Finding a maximum induced matching in weakly chordal graphsDiscrete Math., 266
-
A Brandstädt, VB Le, JP Spinrad (1999)
Graph Classes: A Survey -
PC Fishburn, WT Trotter (1992)
Dimensions of hypergraphsJ. Comb. Theory Ser. B, 56
-
J Mycielski (1955)
Sur le coloriage des graphesColloq. Math., 3
-
MC Golumbic, M Lewenstein (2000)
New results on induced matchingsDiscrete Appl. Math., 101
-
DG Corneil, J Stacho (2015)
Vertex ordering characterizations of graphs of bounded asteroidal numberJ. Graph Theory, 78
-
H Broersma, V Patel, A Pyatkin (2014)
On toughness and Hamiltonicity of $$2K_2$$ 2 K 2 -free graphsJ. Graph Theory, 75
-
J-M Chang (2003)
Induced matchings in asteroidal triple-free graphsDiscrete Appl. Math., 132
-
FS Roberts (1969)
Recent Progresses in Combinatorics -
M Basavaraju, LS Chandran, MC Golumbic, R Mathew, D Rajendraprasad (2015)
Separation dimension of graphs and hypergraphsAlgorithmica, 75
-
N Alon, M Basavaraju, LS Chandran, R Mathew, D Rajendraprasad (2015)
Separation dimension of bounded degree graphsSIAM J. Discrete Math., 29
-
V Chvátal, PL Hammer (1977)
Aggregation of inequalities in integer programmingAnn. Discrete Math., 1
-
MC Golumbic (2004)
Algorithmic Graph Theory and Perfect Graphs -
JA Telle (2005)
Tree-decompositions of small pathwidthDiscrete Appl. Math., 145
-
FRK Chung, A Gyárfás, Z Tuza, WT Trotter (1990)
The maximum number of edges in $$2K_2$$ 2 K 2 -free graphs of bounded degreeDiscrete Math., 81
- Publisher
- Springer Journals
- Copyright
- Copyright © 2017 by Springer Science+Business Media, LLC
- Subject
- Computer Science; Algorithm Analysis and Problem Complexity; Theory of Computation; Mathematics of Computing; Algorithms; Computer Systems Organization and Communication Networks; Data Structures, Cryptology and Information Theory
- ISSN
- 0178-4617
- eISSN
- 1432-0541
- DOI
- 10.1007/s00453-017-0353-x
- Publisher site
- See Article on Publisher Site
Abstract
A linear ordering of the vertices of a graph G separates two edges of G if both the endpoints of one precede both the endpoints of the other in the order. We call two edges $$\{a,b\}$$ { a , b } and $$\{c,d\}$$ { c , d } of G strongly independent if the set of endpoints $$\{a,b,c,d\}$$ { a , b , c , d } induces a $$2K_2$$ 2 K 2 in G. The induced separation dimension of a graph G is the smallest cardinality of a family $$\mathcal {L}$$ L of linear orders of V(G) such that every pair of strongly independent edges in G are separated in at least one of the linear orders in $$\mathcal {L}$$ L . For each $$k \in \mathbb {N}$$ k ∈ N , the family of graphs with induced separation dimension at most k is denoted by $${\text {ISD}}(k)$$ ISD ( k ) . In this article, we initiate a study of this new dimensional parameter. The class $${\text {ISD}}(1)$$ ISD ( 1 ) or, equivalently, the family of graphs which can be embedded on a line so that every pair of strongly independent edges are disjoint line segments, is already an interesting case. On the positive side, we give characterizations for chordal graphs in $${\text {ISD}}(1)$$ ISD ( 1 ) which immediately lead to a polynomial time algorithm which determines the induced separation dimension of chordal graphs. On the negative side, we show that the recognition problem for $${\text {ISD}}(1)$$ ISD ( 1 ) is NP-complete for general graphs. Nevertheless, we show that the maximum induced matching problem can be solved efficiently in $${\text {ISD}}(1)$$ ISD ( 1 ) . We then briefly study $${\text {ISD}}(2)$$ ISD ( 2 ) and show that it contains many important graph classes like outerplanar graphs, chordal graphs, circular arc graphs and polygon-circle graphs. Finally, we describe two techniques to construct graphs with large induced separation dimension. The first one is used to show that the maximum induced separation dimension of a graph on n vertices is $$\Theta (\lg n)$$ Θ ( lg n ) and the second one is used to construct AT-free graphs with arbitrarily large induced separation dimension. The second construction is also used to show that, for every $$k \ge 2$$ k ≥ 2 , the recognition problem for $${\text {ISD}}(k)$$ ISD ( k ) is NP-complete even on AT-free graphs.
Journal
Algorithmica – Springer Journals
Published: Jul 31, 2017