Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,975,814 papers from all fields of science
Search
Sign In
Create Free Account
Cograph
Known as:
P 4-free graph
, P4 free graph
, P4-free graph
Expand
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
44 relations
Chordal completion
Chromatic polynomial
Clique (graph theory)
Clique problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Oriented coloring on recursively defined digraphs
Frank Gurski
,
Dominique Komander
,
Carolin Rehs
Algorithms
2019
Corpus ID: 91183957
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied…
Expand
2015
2015
Improved PSO for TNDBDCP
Kai Shao
,
Kang Zhou
,
Yingying Duan
,
Wenbo Dong
2015
Corpus ID: 54696553
Traffic network distribution based on distribution center problem (TNDBDCP) is put forward, which can not be solved by…
Expand
2012
2012
Combinatorial Logarithm and Point-Determining Cographs
Ji Li
Electronic Journal of Combinatorics
2012
Corpus ID: 10880315
We obtain the reduced form of the “combinatorial logarithm” Ω by looking at bijections related to connected point-determining…
Expand
2011
2011
The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph
N. Achuthan
,
N. Achuthan
,
M. Simanihuruk
The Australasian Journal of Combinatorics
2011
Corpus ID: 132721
Ag raph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced…
Expand
2011
2011
A NOTE ON THE EXISTENCE OF AN ALTERNATING SIGN ON A SPANNING TREE OF GRAPHS
Dongseok Kim
,
Y. Kwon
,
Jaeun Lee
2011
Corpus ID: 117970459
DONGSEOK KIM, YOUNG SOO KWON, AND JAEUN LEEAbstract. For a spanning tree T of a connected graph G and for a labelling φ : E(T…
Expand
2010
2010
The overlap number of a graph
Bill Rosgen
,
Lorna Stewart
arXiv.org
2010
Corpus ID: 18585879
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and…
Expand
2002
2002
Criteria for Balance in Abelian Gain Graphs ∗
K. Rybnikov
,
T. Zaslavsky
2002
Corpus ID: 18932240
A gain graph (Γ, g, G) is a graph Γ = (V,E) together with a group G, the gain group, and a homomorphism g, the gain function…
Expand
2001
2001
An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs
H. D. Fraysseix
,
P. D. Mendez
2001
Corpus ID: 125276831
We present a simple linear time algorithm finding a Kuratowski subdivision in a DFS cotree critical graphs, based on recent…
Expand
1994
1994
A Cleanup on Transitive Orientation
Klaus Simon
,
Paul Trunz
Orders, Algorithms, and Applications
1994
Corpus ID: 16893850
In the past, different authors developed distinct approaches to the problem of transitive orientation. This also resulted in…
Expand
1959
1959
On a Problem of Network Topology
T. Fujisawa
1959
Corpus ID: 123113565
In mesh-basis analysis of networks with mutual and active elements, it is necessary to list all possible trees or cotrees and…
Expand