Avoidable vertices and edges in graphs: existence, characterization, and applications
From MaRDI portal
Publication:2065802
Recommendations
Cites work
- scientific article; zbMATH DE number 3914360 (Why is no real title available?)
- scientific article; zbMATH DE number 11983 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- A Dirac-type characterization of \(k\)-chordal graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- An algorithm for fraternal orientation of graphs
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
- Approximation algorithms for intersection graphs
- Avoidable paths in graphs
- Avoidable vertices and edges in graphs
- CLUSTER ALGEBRAS OF FINITE TYPE AND POSITIVE SYMMETRIZABLE MATRICES
- Characterizations and algorithmic applications of chordal graph embeddings
- Convexity in Graphs and Hypergraphs
- Dirac-type characterizations of graphs without long chordless cycles
- Efficient bounds for the stable set, vertex cover and set packing problems
- Efficient graph representations
- Elimination graphs
- Extremities and orderings defined by generalized graph search algorithms
- Finding induced subgraphs via minimal triangulations
- Generating weakly triangulated graphs
- Graph Classes: A Survey
- Graph extremities defined by search algorithms
- House of Graphs: a database of interesting graphs
- In-tournament digraphs
- Incidence matrices and interval graphs
- Large Induced Subgraphs via Triangulations and CMSO
- Linear-time recognition of circular-arc graphs
- Listing all potential maximal cliques of a graph
- Max flows in \(O(nm)\) time, or better
- Maximum cardinality search for computing minimal triangulations of graphs
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Minimal triangulations of graphs: a survey
- On cyclically orientable graphs
- On rigid circuit graphs
- On the semi-perfect elimination
- Partial characterizations of 1-perfectly orientable graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Reducibility among combinatorial problems
- Separability generalizes Dirac's theorem
- Shifting paths to avoidable ones
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Treewidth and minimum fill-in: Grouping the minimal separators
- Treewidth versus clique number in graph classes with a forbidden structure
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Triangulated graphs and the elimination process
- Vertex elimination orderings for hereditary graph classes
- \(1\)-perfectly orientable graphs and graph products
Cited in
(5)
This page was built for publication: Avoidable vertices and edges in graphs: existence, characterization, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065802)
