Graphs vertex-partitionable into strong cliques
From MaRDI portal
Publication:1709542
DOI10.1016/j.disc.2018.02.013zbMath1383.05239arXiv1609.06961OpenAlexW2963848864WikidataQ130088725 ScholiaQ130088725MaRDI QIDQ1709542
Bernard Ries, Martin Milanič, Ademir Hujdurović
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.06961
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ Strong cliques in vertex‐transitive graphs ⋮ Strong cliques in diamond-free graphs ⋮ Detecting strong cliques ⋮ Mind the independence gap
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equistarable bipartite graphs
- On well-covered, vertex decomposable and Cohen-Macaulay graphs
- Coloring, sparseness and girth
- On equistable, split, CIS, and related classes of graphs
- On CIS circulants
- Vertex-transitive CIS graphs
- Pure simplicial complexes and well-covered graphs
- Progress in commutative algebra 1. Combinatorics and homology
- Weakly triangulated graphs
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Stochastic graphs and strongly perfect graphs - a survey
- On a conjecture of Meyniel
- Linear time algorithms on circular-arc graphs
- A characterization of well covered graphs of girth 5 or greater
- Geometric algorithms and combinatorial optimization
- Matching-perfect and cover-perfect graphs
- On the perfect graph conjecture
- Well-covered graphs and extendability
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- The structure of well-covered graphs and the complexity of their recognition problems
- Cohen-Macaulay graphs
- Very well covered graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Algorithmic graph theory and perfect graphs
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Well-covered claw-free graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A characterization and hereditary properties for partition graphs
- Approximating clique-width and branch-width
- Cohen--Macaulay chordal graphs
- Normal hypergraphs and the perfect graph conjecture
- The structure of well-covered graphs with no cycles of length 4
- ModelingK-coteries by well-covered graphs
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
- Unmixed Graphs that are Domains
- Domination on Cocomparability Graphs
- Complexity results for well‐covered graphs
- Matchings in polytopal graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Local Structure When All Maximal Independent Sets Have Equal Weight
- Graph Classes: A Survey
- WELL-COVERED GRAPHS: A SURVEY
- On Representatives of Subsets
- Well covered simplicial, chordal, and circular arc graphs
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Paths, Trees, and Flowers
- Some covering concepts in graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Sur le coloriage des graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Graphs vertex-partitionable into strong cliques
