Clique-perfectness of complements of line graphs (Q5919747): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.01.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2174987007
@@ Property / OpenAlex ID: W2174987007 / rank @@
+Normal rank
@@ Property / cites work @@
+On small graphs critical with respect to edge colourings
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636932
@@ Property / cites work: Q5636932 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
+Normal rank
@@ Property / cites work @@
+Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Clique-perfectness of complements of line graphs
@@ Property / cites work: Clique-perfectness of complements of line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Dually Chordal Graphs
@@ Property / cites work: Dually Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On linear and circular structure of (claw, net)-free graphs
+Normal rank
@@ Property / cites work @@
+Colouring the petals of a graph
@@ Property / cites work: Colouring the petals of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Neighborhood Numbers
@@ Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum \(h\)-colourable subgraph problem in balanced graphs
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for clique-independent sets on subclasses of circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for finding clique-transversals of graphs
+Normal rank
@@ Property / cites work @@
+On clique-transversals and clique-independent sets
+Normal rank
@@ Property / cites work @@
+Covering the cliques of a graph with vertices
@@ Property / cites work: Covering the cliques of a graph with vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of clique-transversal and clique-independent sets
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+The number of caterpillars
@@ Property / cites work: The number of caterpillars / rank @@
+Normal rank
@@ Property / cites work @@
+Trees with Hamiltonian square
@@ Property / cites work: Trees with Hamiltonian square / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic index of a graph whose core has maximum degree two
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs are clique-perfect
@@ Property / cites work: Distance-hereditary graphs are clique-perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood perfect graphs
@@ Property / cites work: Neighborhood perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+On clique-complete graphs
@@ Property / cites work: On clique-complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels in perfect line-graphs
@@ Property / cites work: Kernels in perfect line-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Coloring Partialk-Trees
@@ Property / cites work: Edge-Coloring Partialk-Trees / rank @@
+Normal rank