scientific article; zbMATH DE number 3889564
From MaRDI portal
Publication:3222874
zbMATH Open0558.05036MaRDI QIDQ3222874FDOQ3222874
Authors: Michel Burlet, Jean-Pierre Uhry 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- Convex parity graphs
- Parity dimension for graphs
- Graph decomposition and parity
- Parity equivalence in eulerian graphs
- Parity and disparity subgraphs
- Highly parity linked graphs
- Parallel algorithms for parity graphs
- On parity combination cordial graphs
- Parity combination cordial labeling of graphs
- Metric characterization of parity graphs
Cited In (41)
- Two-colourings that decompose perfect graphs
- Twin subgraphs and core-semiperiphery-periphery structures
- On perfectness of sums of graphs
- Parallel algorithms for parity graphs
- Murky graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract)
- Path parity and perfection
- Parity graphs are kernel-M-solvable
- Locally perfect graphs
- \(k\)-NLC graphs and polynomial algorithms
- On slim graphs, even pairs, and star-cutsets
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Parity dimension for graphs
- The clique operator on cographs and serial graphs
- A fast algorithm for coloring Meyniel graphs
- Skeletal graphs - a new class of perfect graphs
- Unavoidable doubly connected large graphs
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
- Parity versions of 2-connectedness
- On the optimal transversals of the odd cycles
- The complexity of the parity argument with potential
- Dominating sets in perfect graphs
- Counting all parity realizable trees
- Practical and efficient split decomposition via graph-labelled trees
- Title not available (Why is that?)
- Minimax relations for the partial q-colorings of a graph
- Parity and disparity subgraphs
- Title not available (Why is that?)
- Classes of perfect graphs
- Title not available (Why is that?)
- Perfectly contractile graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Parallel recognition of complement reducible graphs and cotree construction
- Metric characterization of parity graphs
- How to compute digraph width measures on directed co-graphs
- On \(m\)-centers in \(P_ t\)-free graphs
- Connected sequential colourings
- Reconstruction of 2-connected parity graphs
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Parity Dimension for Graphs - A Linear Algebraic Approach
- The axiomatic characterization of the interval function of distance hereditary graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222874)
